Which of the following technique stores data in the hash table itself in case of a collision?
(a) Open addressing
(b) Chaining using linked list
(c) Chaining using doubly linked list
(d) Chaining using binary tree
I want to ask this question from Hash Tables in division Hash Tables of Data Structures & Algorithms I
The question was asked in quiz.