Q153
Which of the following technique stores data in the hash table itself in case of a collision?
A.
Open addressing
AnswerB.
Chaining using linked list
C.
Chaining using doubly linked list
D.
Chaining using binary tree
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board