Vidyalelo
Data Structure · Q66

Hashing

Programming · Data Structure · question 66

Q66

Which of the following variant of a hash table has the best cache performance?

A.
hash table using a linked list for separate chaining
B.
hash table using binary search tree for separate chaining
C.
hash table using open addressing
Answer
D.
hash table using a doubly linked list for separate chaining

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board