搜索
1.2.CC3.,,,,4.,::,,1[][][]2[][][]3[][][]4[][][]5[][][]6[][][]7[][]AVLAVLAVLAVL[]AVL8[][]KruskalPrimDijkstra[]PrimKruskaldijkstra9[][]k[]10[][]mmBBBB+[]BB+()C()123E.HOrowitz&S.SahniFundamentalsofDataStructures1.()A.B.C.D.B2.HLp()A.HL=p;p-next=HL;B.p-next=HL;HL=p;C.p-next=HL;p=HL;D.p-next=HL-next;HL-next=p;3.HLp()A.HL=p;p-next=HL;B.p-next=HL;HL=p;C.p-next=HL;p=HL;D.p-next=HL-next;HL-next=p;4.nextqpAq=p-next;p-next=q-next;B.p-next=q-next;q=p-nextC.q-next=p-next;p-next=q;D.P-next=q;q-next=p-next;5.AB.C.6.A.B.iC.D.7.().A.B.C.D.8.()A.B.C.D.9.ABC()A.5B.4C.6D.110.AB.C.D.11.()A.O(n)B.O(1)C.O(log2n)D.O(n2)12.3,8,6,2,5________A24B48C72D5313.()A.BCD14.k().Ak-1B.2K+1C.2K-1D.2k-115.().ABC.D16.(2,5,7,10,14,15,18,23,35,41,52),10,A.2B.3C.4D.517.().A.B.C.D.18.()A.acdghmpqrxB.acmdhpxgoC.adprcqxmhgD.adcmpghxr19.nA.O1B.O1og2nC.OnD.On220.A.B.C.D.21.(qgmzanpxh)A.aghmnpqxzB.agmhqnpxC.gmqanpxhzD.hgmpanqx22.().A.B.C.D.1.______________________________________2.______________________________________3.(3n2+2nlog2n+4n-7)/(5n)________4.n_____________________5.n_____________________6.HL________________7.________________8._________________9.________10.W6i08j03WW64W100W11.p_________pa_____________12.__________________13.__________________________14.3+4*2/8-5_______________________________15.423*+105/-__________16.ni(1in)________________________17.5________________18.ABCDEFGHIJ___________________19.K________20.________21.n________WPL_____________________22.__________23._____________________24.i(0in-1)______________25.n________n________26.ne________________27.12________28.(12,23,74,55,63,40,82,36)Key%3_______________________________________29.mn________30.mB_________________________________31._________________________32.ne_______________33._________________34.70345523654120100HK=K%91________7_______35.__________________36.B____________37.________________38.________________39._____________________________40._________1.A[0].nexta01234567data605078903440next43025712.a(b(c),d(e,f))3.ABECDFGHIJ,EBCDAFHIGJ,4.,1(1)1,2,3,4,(2),4123,,(3),3421,,5.(1)A*B*C(2)A+BC+D(3)A*B+C(4)(A+B)*D+E/(F+A*D)+C6.(1)D=a,b,c,d(2)A=a,b,c,d,e7.37,56,23,65,22,10,298.017,094,154,170,275,503,509,512,553,612,677,765,897,908,9.VEV={0,1,2,3,4,5,6,7};E={(0,1)8,(0,2)5,(0,3)2,(1,5)6,(2,3)25,(2,4)13,(3,5)9,(3,6)10,(4,6)4,(5,7)20};10210.VEV={1,2,3,4,5,6,78};E={(1,2),(1,3),(2,4),(2,5),(3,6),(3,7),(4,8),(5,8),(6,8),(7,8)};112111.VEV={0,1,2,3,4,5,6,7};E={(0,2),(1,3),(1,4),(2,4),(2,5),(3,6),(3,7),(4,7),(4,8),(5,7),(6,7),(7,8)};12.0-16HK=K%17262572388185915925913.3615406322[0..6]HK=K%712012345614.(46,79,56,38,40,80,25,34)1.voidAE(Stack&S){InitStack(S);Push(S,30);Push(S,40);Push(S,50);intx=Pop(S)+2*Pop(S);Push(S,x);inti,a[4]={5,8,12,15};for(i=0;i4;i++)Push(S,a[i]);while(!StackEmpty(S))coutPop(S)}2.voidAJ(adjlistGL,inti,intn){QueueQ;InitQueue(Q);coutivisited[i]=true;Qinsert(Q,i);while(!QueueEmpty(Q)){intk=Qdelete(Q);edgenode*p=GL[k];while(p!=NULL){intj=p-adjvex;if(!visited[j]){coutjvisited[j]=true;Qinsert(Q,j);}p=p-next;}}}3.1intsum1(intn){intp=1,s=0;for(inti=1;i=n;i++){p*=i;s+=p;}returns;}2intsum2(intn){ints=0;for(inti=1;i=n;i++){intp=1;for(intj=1;j=i;j++)p*=j;s+=p;}returns;}4.LaListElemTypeintLa1InitList(La);Inta[]={48,26,57,34,62,79};For(i=0;i6;i++)Insert(La,a[i]);TraverseList(La);2Insert(La,56);DeleteFront(La);InsertRear(La,DeleteFront(La));TraverseList(La);3For(i=1;i=3;i++){Intx=GetElem(La,i);If(x%2==0)Delete(La,x);}TraverseList(La);4ClearList(La);For(i=0;i6;i++)InsertRear(La,a[i]);Delete(La,a[5]);Sort(La);Insert(La,a[5]/2);TraverseList(La);1.VoidInsertRear(Lnode*&HL,constElemType&item){Lnode*newptr;newptr=newLnode;If(______________________){cerrMemoryallocationfailare!endl;exit(1);}newptr-data=item;_________________=NULL;if(HL==NULL)HL=newptr;else{Lnode*P=HL;While(P-next!=NULL)____________________;p-next=newptr;}}2.BSTitemvoidInsert(BtreeNode*&BST,constElemType&item){if(BST==NULL){BtreeNode*p=newBtreeNode;p-data=item;_______________________;BST=p;}elseif(itemBST-data)___________________;else________________________;}3.IntBinsch(ElemTypeA[],intlow,inthigh,KeyTypeK){if(low=high){intmid=(low+high)/2;if(_____________________)returnmid;//elseif(KA[mid])returnBinsch(A,low,mid-1,K);//elsereturn_____________________________//}else________________//-1}1.ListLiivoidInsert(List&L,inti,ElemTypex)2.(e0,e1,,en-2,en-1)A[arraySize]n(arraySize=n)n(en-1,en-2,,e1,e0)voidinverse(ElemTypeA[],intn)3.iiNULLLnode*GetANode(Lnode*&HLinti)11.B2.B3.D4.C5.A6.B7.D8.B9.A10.A11.C12.D13.D14.A15.C16.B17.A18.C19.B20.A21.C22.A21.2.3.O(n)4.O(1)O(n)5.O(n)O(1)6.HL-next==NULLHL-next==HL7.8.nextHS9.10.36*6(216)12*67231011.p-nexta[p].next12.13.14.34+2*85-/15.816.2i2i+1i/2i/217.163118.104319.k-120.21.22.23.24.2i+12i+225.n(n-1)/2n(n-1)26.ee27.37/1228.(12,63,36)(55,40,82)(23,74)29.n/m30.m/2-1m-1m/2m31.32.e2e33.O(n2)O(e)34.2235.36.37.O(log2n)O(nlog2n)38.O(nlog2n)O(n2)39.O(n)O(nlog2n)O(n)40.1.(90,34,40,60,78,50)2.a,b,c,d,e,fc,b,a,e,d,fc,b,e,f,d,aa,b,d,c,e,f3.ABECDFGHIJEBC