lecture5 Doubly linked lists and stacks

lecture5 Doubly linked lists and stacks

ID:39715551

大小:176.16 KB

页数:9页

时间:2019-07-09

lecture5  Doubly linked lists and stacks_第1页
lecture5  Doubly linked lists and stacks_第2页
lecture5  Doubly linked lists and stacks_第3页
lecture5  Doubly linked lists and stacks_第4页
lecture5  Doubly linked lists and stacks_第5页
资源描述:

《lecture5 Doubly linked lists and stacks》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

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

2、nentscanonlyLecture5:DoublyLinkedListsandbeaccessedsequentiallyoneaftertheotherLinkedStacks2AnInsertAlgorithmforSortedListsclassSortedListSortedlist:listelementssortedinSortedListascendingorderPrivatedata:~SortedListIsEmptyHowwouldthealgorithmtoinserthead5817Printanitemintoasor

3、tedlinkedlist?InsertTopInsertDeleteTopDelete34ADTSortedListOperationsstructNodeType//SPECIFICATIONFILEDYNAMIC-LINKEDSORTEDLISTTransformers(slist.h)–InsertToptypedefintItemType;//Typeofeachcomponent–Insertchangestate//issimpletypeorstringtype–DeleteTop–DeletestructNodeType{ItemTyp

4、eitem;//Pointertoperson’snameObserversNodeType*next;//linktonextnodeinlist–Printobservestate};–IsEmptytypedefNodeType*NodePtr;651InsertalgorithmforInserting12intoaSortedListSortedListprevPtrcurrPtrfindproperpositionforthenewelementinthesortedlistusingtwopointersprevPtrandcurrPtr

5、,whereprevPtrtrailsbehindPrivatedata:currPtrobtainanodeforinsertionandplaceitemhead5817initinsertthenodebyadjustingpointers78FindingProperPositionfor12FindingProperPositionfor12prevPtrcurrPtrprevPtrcurrPtrNULLPrivatedata:Privatedata:head5817head5817while(currPtr!=NULL&&item>cur

6、rPtr->info)while(currPtr!=NULL&&item>currPtr->info){{prevPtr=currPtr;prevPtr=currPtr;currPtr=currPtr->next;currPtr=currPtr->next;}}910Inserting’12’intoProperPositionFindingProperPositionfor12location->next=currPtr;if(prevPtr==NULL)head=location;prevPtrcurrPtrelseprevPtr->next=loc

7、ation;prevPtrcurrPtrPrivatedata:Privatedata:head5817head5817while(currPtr!=NULL&&item>currPtr->info){prevPtr=currPtr;12currPtr=currPtr->next;}11122voidSortedList::Insert(ItemTypeitem)//IMPLEMENTATIONDYNAMIC-LINKEDSORTEDLIST//Pre:itemisassigned&&listcomponentsinascendingorder//(sl

8、ist.cpp)//Post:newnodecontainingitemisin

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

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

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