Data Structure (Dynamic Array and Linked List)
Download as PPSX, PDF6 likes933 views
The document discusses dynamic arrays and linked lists, explaining their definitions and memory management functions such as allocation and deallocation. It also covers types of linked lists, operations such as insertion and deletion, and procedures for managing linked list nodes. Additionally, it includes examples and algorithms for various linked list operations like front, back, and middle insertions and deletions.
Data Structure (Dynamic Array and Linked List)
- 1. Dynamic Array and Linked List Adam M.B.
- 4. Array which can be managed dynamically in memory (its size). To order the place in memory, it uses POINTER. Description
- 5. Declaration Type Pengenal = โSimpul Simpul = TipeData Atau NamaVariabel : โTipeData
- 6. Example (1) Kamus: Bilangan : โinteger Nama : โstring
- 7. Example (2) Kamus: Type Point = โData Data = Record < Nim : integer, Nama : string, Nilai : real > EndRecord DataMhs : point
- 9. Definition โข Alloc is statement that can be used to order place in memory while program is running. โข Dealloc is statement that can be used to delete place which had been ordered while program is running.
- 10. Ilustration in Memory Alloc(DataMhs) Still Empty DataMhs Nil
- 12. Case Kamus: Type Point = โData Data = Record < NamaMhs : string, Jurusan : string > EndRecord T1,T2: point
- 14. Copy Pointer (Contโd) T1๏ก.NamaMhs ๏ โAdamโ T1๏ก.Jurusan ๏ โTeknik Informatikaโ T2 T1
- 15. Copy Pointer (Contโd) T2 T1 T2 ๏ T1
- 16. Copy Value T1 T2๏ก ๏ T1๏ก T2
- 20. Data structure that is prepared sequentially, dynamically, and infinite. Linked list is connected by pointer. Description
- 21. Array VS Linked List ARRAY LINKED LIST Static Dynamic Insert and Delete are finite Insert and Delete are infinite Random Access Sequential Access Delete element is only delete value Delete element is truly delete space
- 22. โข Single Linked List โข Double Linked List โข Circular Linked List Types of Linked List
- 24. Linked list that its node consists of one link/pointer that refers to another node. Ilustration of node: Description Info Field (Info) Connection Field (Next)
- 25. Declaration Kamus: Type NamaPointer = โSimpul Simpul = Record < InfoField : TipeData, ConnectionField : NamaPointer > EndRecord NamaVarPointer : NamaPointer
- 26. Example Kamus: Type Point = โSimpul Simpul = Record < Info : integer, Next : Point > EndRecord Awal,Akhir : Point
- 28. โข Creation โข Insertion โข Delete โข Traversal โข Searching โข Sorting โข Destroy
- 29. Pointer (awal and akhir) is given nil as their value. Creation awal akhir awal ๏ nil akhir ๏ nil
- 30. โข If list is empty (awal = nil). Front Insertion baru baru 1 baru 1 awal akhir alloc(baru) baru๏ก.next ๏ nil baru๏ก.info ๏ 1 awal ๏ baru akhir ๏ baru
- 31. โข If list isnโt empty (awal โ nil). For example, there is list that has two nodes: Front Insertion (contโd) akhirawal 2 3 One node will be inserted in front of list: 1baru alloc(baru) baru๏ก.info ๏ 1
- 32. New node will be inserted before the node that was refered by awal. Front Insertion (contโd) baru 1 awal 2 akhir 3 baruโ.next ๏ awal
- 33. After new node was inserted, move awal to new node. Front Insertion (contโd) awal 2 3 baru 1 akhir awal ๏ baru
- 34. The last result for front insertion if linked list wasnโt empty: Front Insertion (contโd) baru 1 awal 2 3 akhir
- 35. Procedure SisipDepanSingle(Input elemen : tipedata, I/O awal, akhir : nama_pointer) {I.S. : data yang akan disisipkan (elemen), pointer penunjuk awal dan pointer penunjuk akhir sudah terdifinisi} {F.S. : menghasilkan satu simpul yang disisipkan di depan pada single linked list} Kamus : baru : nama_pointer Algoritma : alloc(baru) baruโ.info ๏ elemen If (awal = nil) Then baruโ.next ๏ nil akhir ๏ baru Else baruโ.next ๏ awal EndIf awal ๏ baru EndProcedure
- 36. โข If list is empty (awal = nil) ๏ the process is same as front insertion if linked list is empty. Back Insertion
- 37. โข If list isnโt empty (awal โ nil). For example, there is list that has two nodes: Back Insertion (contโd) awal 3 2 akhir New node that will be inserted: baru 1 alloc(baru) baru๏ก.next ๏ nil baru๏ก.info ๏ 1
- 38. New node will be inserted after the node that was refered by akhir. Back Insertion (contโd) baru 1 akhirawal 3 2 akhir๏ก.next๏ baru
- 39. Move akhir to new node. Back Insertion (contโd) akhir ๏ baru akhirawal 3 2 baru 1
- 40. The last result for back insertion if linked list wasnโt empty: Back Insertion (contโd) awal 3 2 baru 1 akhir
- 41. Procedure SisipBelakangSingle(Input elemen : tipedata, I/O awal, akhir : nama_pointer) {I.S. : data yang akan disisipkan (elemen), pointer penunjuk awal dan pointer penunjuk akhir sudah terdifinisi} {F.S. : menghasilkan satu simpul yang disisipkan di belakang pada single linked list} Kamus : baru : nama_pointer Algoritma : alloc(baru) baruโ.info ๏ elemen baruโ.next ๏ nil If (awal = nil) Then awal ๏ baru Else akhirโ.next ๏ baru EndIf akhir ๏ baru EndProcedure
- 42. โข If list is empty (awal = nil) ๏ the process is same as front insertion if linked list is empty. Middle Insertion
- 43. โข If list isnโt empty (awal โ nil). Middle Insertion (contโd) awal 2 54 akhir 3 New node that will be inserted after 4: baru 1 alloc(baru) baru๏ก.info ๏ 1
- 44. Search node 4 using sequential search and bantu pointer. Middle Insertion (contโd) bantu baru 1 awal 2 54 akhir 3 bantu
- 45. Connect the connection field from new node to the neighbour node of node that was refered by bantu. Middle Insertion (contโd) baru๏ก.next ๏ bantuโ.next baru 1 awal 2 54 akhir 3 bantu
- 46. After new node was connected with node 4 then refer the connection field of node that was refered by bantu to new node. Middle Insertion (contโd) bantu๏ก.next ๏ baru bantuawal 2 baru 1 4 akhir 3 5
- 47. The last result for middle insertion if linked list wasnโt empty: Middle Insertion (contโd) bantu baru 1 2 akhir 5 awal 43
- 48. Procedure SisipTengahSingle(Input elemen : tipedata, I/O awal, akhir : nama_pointer) {I.S. : data yang akan disisipkan (elemen), pointer penunjuk awal dan pointer penunjuk akhir sudah terdifinisi} {F.S. : menghasilkan satu simpul yang disisipkan di tengah pada single linked list} Kamus : baru,bantu : nama_pointer ketemu : boolean datasisip : tipedata Algoritma : If (awal = nil) Then alloc(baru) baruโ.info ๏ elemen baruโ.next ๏ nil
- 49. awal ๏ baru akhir ๏ baru Else Input(datasisip) bantu ๏ awal ketemu ๏ false While (not ketemu and bantu โ nil) do If (datasisip = bantuโ.info) Then ketemu ๏ true Else bantu ๏ bantuโ.next EndIf EndWhile
- 50. If (ketemu) Then alloc(baru) baruโ.info ๏ elemen If (bantu = akhir) Then sisip_belakang_single(elemen,awal,akhir) Else baruโ.next ๏ bantuโ.next bantuโ.next ๏ baru EndIf Else Output(โData yang akan disisipkan tidak adaโ); EndIf EndIf EndProcedure
- 51. โข Delete one node in beggining of linked list if linked list has only one node (awal = akhir). Front Deletion awal akhir 1
- 52. If deletion happens in linked list with one node then linked list will be empty. Front Deletion (contโd) awal akhir phapus elemen 1phapus phapus ๏ awal elemen ๏ phapus ๏ก.info dealloc(phapus) awal ๏ nil akhir ๏ nil 1 awal akhir
- 53. โข If linked list has more than one node (awal โ akhir). For example, linked list has two nodes. Front Deletion (contโd) awal 2 3 akhir
- 54. Front Deletion (contโd) phapus awal 2 3 akhir elemen awal 2 3phapus akhir phapus ๏ awal elemen ๏ phapus๏ก.info awal ๏ awal๏ก.next dealloc(phapus)
- 55. The last result for front deletion if linked list has more than one node: Front Deletion (contโd) phapus awal 3 akhir 2
- 56. Procedure HapusDepanSingle(Output elemen : tipedata, I/O awal, akhir : nama_pointer) {I.S. : pointer penunjuk awal dan pointer penunjuk akhir sudah terdifinisi} {F.S. : menghasilkan single linked list yang sudah dihapus satu simpul di depan} Kamus : phapus : nama_pointer Algoritma : phapus ๏ awal elemen ๏ baruโ.info If (awal = akhir) Then awal ๏ nil akhir ๏ nil Else awal๏ awal โ.next EndIf dealloc(phapus) EndProcedure
- 57. โข Delete one node in back of linked list if linked list has only one node (awal = akhir). This process is same as front deletion if linked list has only one node. Back Deletion
- 58. โข If linked list has more than one node (awal โ akhir). For example, linked list has three nodes. Back Deletion (contโd) awal 1 32 akhir
- 59. Back Deletion (contโd) phapus awal 1 3 akhir 2 elemen phapus phapusakhirawal 1 32 phapus ๏ awal elemen ๏ akhir๏ก.info phapus ๏ phapus๏ก.next phapus ๏ phapus๏ก.next akhir ๏ phapus
- 60. Back Deletion (contโd) awal 1 3 phapus 2 akhir akhir๏ก.next ๏ nil dealloc(phapus)
- 61. The last result for back deletion if linked list has more than one node: Back Deletion (contโd) phapus phapusakhir 3 awal 12
- 62. Procedure HapusBelakangSingle(Output elemen : tipedata, I/O awal, akhir : nama_pointer) {I.S. : pointer penunjuk awal dan pointer penunjuk akhir sudah terdifinisi} {F.S. : menghasilkan single linked list yang sudah dihapus satu simpul di belakang} Kamus : phapus : nama_pointer Algoritma : phapus ๏ awal elemen ๏ baruโ.info If (awal = akhir) Then awal ๏ nil akhir ๏ nil
- 63. Else while (phapusโ.next โ akhir) do phapus ๏ phapusโ.next endwhile akhir ๏ phapus phapus ๏ phapusโ.next akhirโ.next ๏ nil EndIf dealloc(phapus) EndProcedure
- 64. โข Delete one node in middle of linked list if linked list has only one node (awal = akhir). This process is same as front deletion if linked list has only one node. Middle Deletion
- 65. โข If linked list has more than one node (awal โ akhir). For example, linked list has four nodes and user want to delete third node. Middle Deletion (contโd) awal 2 54 akhir 3
- 66. Search the third node start from the first node. If node is found then save the info of this node to the variable elemen. Middle Deletion (contโd) phapus posisihapus=2awal 2 54 akhir 3 posisihapus=1 posisihapus=3 phapus elemen elemen๏phapus๏ก.info
- 67. Because the connection field of previous node must be connected to the next node of node that will be deleted so we need pointer bantu that refer the node that will be deleted. Middle Deletion (contโd) bantuawal 2 54 phapus akhir 3 posisihapus=3
- 68. Connect the connection field of the node that was referred by pointer bantu to the neighbour node. Delete the node that was referred by pointer phapus. Middle Deletion (contโd) awal 2 54 phapus akhir 3 posisihapus=3bantu bantu๏ก.next ๏ phapus๏ก.next dealloc(phapus)
- 69. The last result for middle deletion if linked list has more than one node: Middle Deletion (contโd) 5 akhir 2 phapus posisihapus=1posisihapus=2 posisihapus=3 phapus bantuawal 43 43 5 akhir awal
- 70. Operation that visiting all nodes in linked list start from the first node until last node. Traversal awal 2 54 akhir 3 For example, shown the process to output data: โข Place one pointer bantu in the first node awa l 2 54 akhir 3 bantu
- 71. The value in info field will be output to screen from the node that was referred by bantu then pointer bantu will move to the next node until all nodes were visited (bantu = nil). Traversal awal 2 54 akhir 3 bantu bantu bantu bantu 3 4 2 5Screen Output:
- 72. Contact Person: Adam Mukharil Bachtiar Informatics Engineering UNIKOM Jalan Dipati Ukur Nomor. 112-114 Bandung 40132 Email: [email protected] Blog: http://adfbipotter.wordpress.com Copyright ยฉ Adam Mukharil Bachtiar 2012