FINAL REVIEW Data Structures Binus
FINAL REVIEW Data Structures Nama : Albertius Christopher Nathan NIM : 2301883643 Kelas : CB-01 / LN-01 Dosen : Gradiyanto Sanjaya (D5327), NICKY HENDRIK SEN (NH191), WAHYU (WU191) [LN-01] Henry Chong (D4460), Ferdinand Ariandy Luwinda ( D4522) [CB-01] 1. Linked List sa Linked List is pretty similar to array, but Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers. Linked List are divided into 2 types, the Single Linked List and Double Linked List. To read more about linked lists, you can go here 2. Hashing, Hash Tables, and Binary Tree Hashing is an important Data Structure which is designed to use a special function called the Hash function which is used to map a given value with a particular key for faster access of elements. The efficiency of mapping depends of the efficiency of the hash function used. Hash Table is a data s