数据结构相关-zju课件.pptxVIP

CHAPTER3Lists,Stacks,andQueues§1AbstractDataType(ADT)【Definition】DataType={Objects}?{Operations}〖Example〗int={0,?1,?2,???,INT_MAX,INT_MIN}?{?,?,?,?,?,???}【Definition】AnAbstractDataType(ADT)isadatatypethatisorganizedinsuchawaythatthespecificationontheobjectsandspecificationoftheoperationsontheobjectsareseparatedfromtherepresentationoftheobjectsandtheimplementationontheoperations.1/14

§2TheListADTObjects:(item0,item1,???,itemN?1)Operations:?Findingthelength,N,ofalist.?Printingalltheitemsinalist.?Makinganemptylist.?Findingthek-thitemfromalist,0?kN.?Insertinganewitemafterthek-thitemofalist,0?kN.?Deletinganitemfromalist.?Findingnextofthecurrentitemfromalist.?Findingpreviousofthecurrentitemfromalist.?ADT:Whyafter?2/14

1.SimpleArrayimplementationofLists§2TheListADTarray[i]=itemi?MaxSizehastobeestimated.AddressContentarray+iitemiarray+i+1itemi+1……Sequentialmapping?Find_KthtakesO(1)time.?InsertionandDeletionnotonlytakeO(N)time,butalsoinvolvealotofdatamovementswhichtakestime.3/14

§2TheListADT2.LinkedListsAddressDataPointer0010001101101011SUNQIANZHAOLI101100100011NULLHeadpointerptr=0110ZHAOQIANSUNLIptrNULLInitialization:typedefstructlist_node*list_ptr;typedefstructlist_node{chardata[4];list_ptrnext;};list_ptrptr;Tolink‘ZHAO’and‘QIAN’:list_ptrN1,N2;N1=(list_ptr)malloc(sizeof(structlist_node));N2=(list_ptr)malloc(sizeof(structlist_node));N1-data=‘ZHAO’;N2-data=‘QIAN’;N1-next=N2;N2-next=NULL;ptr=N1;ZHAOQIANptrNULLLocationsofthenodesmaychangeondifferentruns.4/14

§2TheListADTa1ptrNULLaiai+1an......Insertionnodebtemp?temp-next=node-next?node-next=tempQuestion:Whatwillhappeniftheorderofthetwostep