Which of the following technique stores data separately in case of a collision?
(a) Open addressing
(b) Double hashing
(c) Quadratic probing
(d) Chaining using a binary tree
This is a very interesting question from Hash Tables in section Hash Tables of Data Structures & Algorithms I
This question was addressed to me in an interview.