Which of the following statements about hash tables is NOT correct?
A) Each entry in a hash table points to a sequence of nodes whose elements have the same compressed hash code.
B) Elements with the same hash code are stored as nodes in a bucket associated with that hash code.
C) A compressed hash code is used as an array index into the hash table.
D) All elements of a hash table must be searched sequentially to determine if an element already exists.

Question

Quizplus · Accepted Answer

Hash tables use hash codes to directly access elements, so they do not require sequential searching for existence checks.

Which of the Following Statements About Hash Tables Is NOT