What kind of data structure is used to resolve collisions in a hash table…
2024
What kind of data structure is used to resolve collisions in a hash table through chaining?
Answer: C. LinkedList — LinkedLists are used in chaining to resolve collisions. Each bucket of the hash table has a linked list. All elements that hash to the same index are stored…
- A.
Queue
- B.
Stack
- C.
LinkedList
- D.
None of the above
Attempted by 602 students.
Show answer & explanation
Correct answer: C
LinkedLists are used in chaining to resolve collisions. Each bucket of the hash table has a linked list. All elements that hash to the same index are stored in the list at that index.
Loading lesson…