Hashtables Chaining with Doubly Linked Lists
Implementing hash table using Chaining through Doubly Linked List is similar to implementing Hashtable using Singly Linked List. The only difference is that every node of Linked List has the address of both, the next and the previous node. This will speed up the process of adding and removing elements from the list, hence the time complexity will be reduced drastically.
If we have a Singly linked list:1->2->3->4
If we are at 3 and there is a need to remove it, then 2 need to be linked with 4 and as from 3, 2 can’t be accessed as it is singly linked list. So, the list has to be traversed again i.e O(n), but if we have doubly linked list i.e.1<->2<->3<->4
2 & 4 can be accessed from 3, hence in O(1), 3 can be removed.
Below is the implementation of the above approach:
Value 5 was successfully added at key 4 Element found at key 4: 5 Element was successfully removed at the key 4
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.