+1 vote
in Data Structures & Algorithms I by (88.2k points)
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.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct option is (d) Chaining using a binary tree

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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.