Hash tables commonly use _______ as a method to resolve collisions when two keys hash to the same index.

  • Chaining
  • Hashing
  • Probing
  • Sorting
Hash tables commonly use chaining as a method to resolve collisions. Chaining involves each bucket maintaining a linked list of key-value pairs that hash to the same index. When a collision occurs, the new key-value pair is simply appended to the linked list at that index.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *