Algorithms Quiz | SP Contest 4 | Question 4
Default collision handling in hashing with chaining is done through singly linked lists. Which data structure can be used to improve the default collision handling where there are many collisions happening with some keys?
(A) Doubly Linked Lists
(B) Circular Linked Lists
(C) Circular Doubly Linked List
(D) Red Black Trees
Explanation: If chain becomes big, we end-up with linear time searching for node in chain. Red Black Trees can improve this time to O(Log n)
Quiz of this Question