What strategy does the hashing implementation of a dictionary use?
A) a binary search tree
B) quadratic probing
C) linear probing/bucket
D) bucket/chaining

Question

Quizplus · Accepted Answer

The best choice for hashing implementation of a dictionary is bucket/chaining as it allows for collisions to be handled by creating a linked list in each bucket. This ensures constant time lookups and insertions, even in the event of collisions.

What Strategy Does the Hashing Implementation of a Dictionary Use