Algorithm for Inserting a node in a linked list

Algorithm for Inserting a node in a linked list

ID:22229331

大?。?9.00 KB

頁(yè)數(shù):34頁(yè)

時(shí)間:2018-10-27

Algorithm for Inserting a node in a linked list_第1頁(yè)
Algorithm for Inserting a node in a linked list_第2頁(yè)
Algorithm for Inserting a node in a linked list_第3頁(yè)
Algorithm for Inserting a node in a linked list_第4頁(yè)
Algorithm for Inserting a node in a linked list_第5頁(yè)
資源描述:

《Algorithm for Inserting a node in a linked list》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在學(xué)術(shù)論文-天天文庫(kù)。

1、----------專業(yè)最好文檔,專業(yè)為你服務(wù),急你所急,供你所需-------------文檔下載最佳的地方MemoryAllocation:1.Static–thesize/spaceisallocatedaltogetherinonelocationinasequenceforthedatainadvanceandcannotbechangedonceallocated.Example:Array2.Dynamic-thesize/spaceisallocatedrandomlyfromanywhereint

2、hememoryforthedataasandwhenneededsoitcanbechangedeasily.Example:LinkedlistsTypesofLinkedLists:1.SinglyLinkedlists(SLL)–onlyonelinkfromonenodetoanother2.DoublyLinkedlists(DLL)–twolinksbetween2nodes3.CircularLinkedLists(CLL)–lastnodepointstothefirstnodeOperation

3、sthatcanbeperformedonaSinglyLinkedlist:1.Insert/Addanewnodeinthelista)inthebeginningofthelistb)attheendofthelistc)inbetween2nodesofthelist2.Delete/Removeanodefromthelista)fromthebeginningofthelistb)fromtheendofthelistc)frombetween2nodesofthelist3.Traverse(read

4、anddisplaythevalues)thenodesinthelistAlgorithmforInsertinganodeinanemptylist:(insertingthe1stnode)1.Start=null//thereisnonodeinthelist2.Createnewnode//allocatememoryforthedatatobeinserted3.newnode.data=data//storethevalueinthedatafieldofthenewnode4.start=newno

5、de//makestartpointtothefirstnode5.newnode.next=null//thereisnonodeafterthisnodeAlgorithmforInsertinganodeattheendofalistthatalreadyhasoneormorenodes:1.ifStartisnotNULL//thereisatleastonenodepresentinthelist2.current=start//createacopyofstartwhichisusedtolocate

6、thelastnodesothatwedon’tlosethefirstnode3.Repeatcurrent=current.nextuntil----------專業(yè)最好文檔,專業(yè)為你服務(wù),急你所急,供你所需-------------文檔下載最佳的地方----------專業(yè)最好文檔,專業(yè)為你服務(wù),急你所急,供你所需-------------文檔下載最佳的地方current.next=null//(thepointerismovedfromonenodetoanotherinordertofindthelast

7、node)1.current.next=newnode//insertthenewnodeafterthelastnode2.newnode.next=null//newnodeisthelastnode----------專業(yè)最好文檔,專業(yè)為你服務(wù),急你所急,供你所需-------------文檔下載最佳的地方----------專業(yè)最好文檔,專業(yè)為你服務(wù),急你所急,供你所需-------------文檔下載最佳的地方AlgorithmforInsertinganodeinanemptylistusingLAST

8、:(insertingthe1stnode)1.start=nulllast=null//thereisnonodeorthelistdoesnotexist2.createnewnode3.newnode.data=data4.start=newnode5.last=newnode//newnodeistheonlynodeinthelistsoitist

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

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

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