A hash table typically consists of an array of _______ and a hash function that maps _______ to indices in the array.

  • Buckets, keys
  • Elements, addresses
  • Linked lists, keys
  • Nodes, values
A hash table typically consists of an array of buckets and a hash function that maps keys to indices in the array. The array is divided into buckets, each capable of holding multiple key-value pairs. The hash function determines which bucket a key should go to.
Add your answer
Loading...

Leave a comment

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