Which of the following technique stores data in a separate entity in case of a collision?
(a) Open addressing
(b) Chaining using doubly linked list
(c) Linear probing
(d) Double hashing
This is a very interesting question from Hash Tables in portion Hash Tables of Data Structures & Algorithms I
I got this question during an online interview.