Linked List

Linked List
Linked List is a type of linear data structure. It is not like an array but instead linked list elements are not stored at a contiguous location. In linked list the elements are linked using pointers. A linked list is better than array in terms of insertion and deletion since linked list makes it easier to do that. A drawback about using Linked List is that it doesn't allow random access instead it has to access it sequentially starting from the 1st node. we cannot use binary search with linked list with its default implementation.

 A Linked list is represented by a pointer on the 1st node of the linked list which is called the "head". If a linked list is empty the value of the head is NULL. Each node in a list consist of a minimal of 2 parts which is data and a pointer. 

Comments

Post a Comment

Popular posts from this blog

Image
Hashing Hashing is a technique used for storing and retrieving keys in a quicker option.  A  hash is  a value computed from a base input number using a hashing function.  In hashing, a string of characters is transformed into a usually shorter length value or key that represents the original string. Hashing is used to index and retrieve items in a database because it is faster to find an item using shorter hashed keys than to find it using the original value. Hash Table Hash table is an array where it stores the original string. The index of the table is the hashed key while the value is the original string. The size of the hash table is usually several orders of magnitude lower than the total number of possible string, so several strings might have the same hashed-keys. Example: Supposed we want to store 5 string: Apple, Fish, Banana, Dog, Chair into a hash table with size 26. The hash function we are gonna use is “transform the first letter o...
Read more