Which of the following technique stores data in the hash table itself in case of a collision?

Category: QuestionsWhich of the following technique stores data in the hash table itself in case of a collision?
Editor">Editor Staff asked 4 weeks ago

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.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Correct answer is (a) Open addressing
 
To explain: Open addressing is used to store data in the table itself in case of a collision. Whereas chaining stores data in a separate entity.