Linked List : Is it an Array?


Apa itu Linked List? Seperti namanya, Linked list adalah struktur data yang dimodelkan linier, hampir sama dengan Array, well, keduanya adalah struktur data linier. Mereka mungkin terdengar sama, tetapi ada perbedaan di antara mereka. Apa yang membedakan antara array dan Linked List? Sementara kita tahu bahwa array disimpan dalam bentuk pada memori yang berdekatan, ini berbeda dalam kasus daftar tertaut, di mana mereka tidak benar-benar menggunakan lokasi yang berdekatan, melainkan, mereka menautkan satu sama lain menggunakan pointer.

Uniknya, Linked list dapat melakukan penambahan dan penghapusan dari elemen apapun di lokasi manapun, asalkan mereka terhubung.



Linked list dapat dibagi menjadi 4 jenis :
1. Singular Linked List
2. Double Linked List
3. Circular Single Linked List
4. Circular Double Linked List

Singular Linked List
Adalah linked list yang paling umum, dimana suatu linked list memiliki ujung pertama node yang bernama head dan memiliki ujung lainnya yang bernama tail, dimana tail akan menunjukan NULL.

Double Linked List
Seperti Linked List, yang membedakan Singular Linked list dengan doubly linked list adalah, Singular linked list hanya memiliki 1 pointer, yang menunjukan node selanjutnya, dimana pada doubly linked list, setiap node memiliki dua pointer, dimana pointer tersebut dapat menunjukkan node selanjutnya, maupun menunjukkan node sebelumnya.

Circular Single Linked List


Hampir mirip dengan singular linked list, yang membedakan singular linked list dengan versi cirularnya adalah, pointer next pada node tail, akan menunjukan addressnya kepada node head, sehingga mereka terhubung dan dapat dikatakan membentuk linkaran.

Circular Doubly Linked List

Seperti Circular Singular Linked List, yang membedakan circular single linked list dengan circular doubly linked list adalah jumlah pointernya, dimana pada node head, terdapat 2 pointer dimana pointer nextnya menunjukkan node selanjutnya, sedangkan pointer previousnya menunjukkan node tail. Sama seperti node headnya, pointer next dari node tail akan menunjukkan node head.



Komentar

Posting Komentar

Postingan populer dari blog ini

Heap (Max And Min) & Tries

Gambar
Heap Heap is a Tree Type data structure that has a complete set of nodes. Heaps are used in store array. What so special about Heaps is that every time we inserted value to it, it used its own  Algorithm to sort itself and the way of indexing them is through left to right nodes in every level. You can access a parent of the node by dividing their index by 2. Types of Heap  A. Max Heap In Max Heap Binary Tree, The parent of the node child holds a value that is greater than its child value. The Max Value of the Tree is located at the Root of the tree. B. Min Heap In Max Heap Binary Tree, The parent of the node child holds a value that is smaller than its child value. The Min Value of the Tree is located at the  Root  of the tree. Min Max Heap C. Min Max Heap Min Max Heap is a special case of Heap. It lets you build a tree structure that has an alternating structure where odd heights of the tree prioritize minimum value while the even heights prioritize m
Baca selengkapnya

Hash and Trees

Gambar
This GSLC Session, My lecturer asking us to make a blog about Hashing and Trees. So here it is, my take on Hashing and Trees Data structure. What is Hashing? Hashing is a technique used for temporary storing and retrieving keys in a rapid and fast manner. Hashing is used as a data structure because for example, if you want to find if there is a certain string that exists in an array, we could make a key to connect it with so it's easier and more efficient to do search function for it.  Hashing is used to index and retrieve items in a database because it is faster to find the item using shorter hashed keys than to find it using the original value. The example of hashing in real-life implementation is cryptocurrency. Hash Table A hash table is a data structure that consists of a table and a function to map unique key values for each row and become the number of record locations in a table. The advantage of hash tables is that the time to access is faster because the recor
Baca selengkapnya