Complete the following code, which is intended to add an element to a hash table. Assume that the computed and compressed hash code is stored in the variable h. Node newNode = new Node();
NewNode.data = x;
_________________
_________________
A) newNode.next = buckets[h + 1];
Buckets[h] = newNode;
B) newNode.next = buckets[h];
Buckets[h + 1] = newNode;
C) newNode.next = buckets[h];
Buckets[h - 1] = newNode;
D) newNode.next = buckets[h];
Buckets[h] = newNode;

Question

Quizplus · Accepted Answer

The correct way to add an element to a hash table is to set the new node's next pointer to the current head of the list at the computed index (buckets[h]) and then update the head of the list to be the new node (buckets[h] = newNode).

Complete the Following Code, Which Is Intended to Add an Element