lecture4 Linked Lists

lecture4 Linked Lists

ID:39715556

大小:202.26 KB

页数: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》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

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

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。