lecture4 Linked Lists

lecture4 Linked Lists

ID:39715556

大小:202.26 KB

頁數(shù):13頁

時間:2019-07-09

lecture4  Linked Lists_第1頁
lecture4  Linked Lists_第2頁
lecture4  Linked Lists_第3頁
lecture4  Linked Lists_第4頁
lecture4  Linked Lists_第5頁
資源描述:

《lecture4 Linked Lists》由會員上傳分享,免費在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫

1、ListsCS122AlgorithmsandDataStructuresAlistisavarying-length,linearcollectionofhomogeneouselements.Linearmeanseachlistelement(exceptthefirst)hasauniquepredecessor,andeachelement(exceptthelast)hasauniqueMW11:00am-12:15pm,MSEC101successorInstructor:XiaoQinInalinearstructure,componentscanonlybeacce

2、ssedsequentiallyoneaftertheLecture4:LinkedListsother2Lists(cont.)ListsasADTsDomainItnormallyhastwo"special"named–Acollectionelementsofthesametypeelementscalledheadandtail.They–Animplicitlistcursorintherange1throughn+1wherenisthecurrentlengthofthelist.pointtothefirstandlastelementoftheOperations

3、list.–create():createanewlist.Shouldbedoneusingconstructors–BooleanIsEmpty()&BooleanIsFull():returnstrueifthelistisemptyandfullrespectively–voidInsertBeginning(v)&voidInsertEnd(v):Insertthevalueveitherintheendorthebeginningofthelist–voidDelete():itematlistcursordeleted–print():PrintthewholelistMor

4、eListOperationsArray-basedclassListOperations–insertAfter(v,anotherV):insertthevaluevafterthefirstoccurrenceofanotherV.IsEmpty–insertBefore(v,anotherV):InsertthevaluevIsFullPrivatedata:beforethefirstoccurrenceofanotherV.Lengthlength–search(v):searchforthefirstoccurrenceofvinthelistandreturnitspos

5、ition.CouldbeusedtohelptheInsertdata[0]implementationofseveralotheroperations[1]–deleteAll(v):DeletealloccurrencesofvinthelistDelete[2]–reset():Listcursorisatfrontoflist.IsPresent[MAX_LENGTH-1]Wecanassumethatprivatedatainalistincludesthelistsitself(usinganarrayorlinkedlist),thePrinthead,thetailan

6、dthesizeofthelistSortedList61//ARRAY-BASEDLIST(list.h)constintMAX_LENGTH=50;typedefintItemType;HowtoImplementaListclassSortedList{public://publicmemberfunctionsuseabuilt-inarraystoredincontiguousmemorySortedList();//constructorlocations,implementingoperationsInsertandboolIsEmpty()const;Deletebymo

7、vinglistitemsaroundinthearray,boolIsFull()const;intLength()const;//returnslengthoflistasneededvoidInsert(ItemTypeitem);voidDelete(ItemTypeitem);usealinkedlist(toavoidexcessivedataboolIsPresent(ItemTypeitem)const

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動畫的文件,查看預(yù)覽時可能會顯示錯亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負責(zé)整理代發(fā)布。如果您對本文檔版權(quán)有爭議請及時聯(lián)系客服。
3. 下載前請仔細閱讀文檔內(nèi)容,確認文檔內(nèi)容符合您的需求后進行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時可能由于網(wǎng)絡(luò)波動等原因無法下載或下載錯誤,付費完成后未能成功下載的用戶請聯(lián)系客服處理。