Question

When implementing a hash table, which of the following collision resolution techniques is known for its efficiency and is based on creating a linked list for each bucket that stores collided elements?

A Linear probing
B Quadratic probing
C Separate chaining
D Double hashing
Practice Next

Relevant for Exams:

Hey! Ask a query