In the hashing implementation of a set, self.index refers to the index of the chain in which the node was just located, or is -1 otherwise.

Question

Quizplus · Accepted Answer

In the chaining implementation of a set, each slot in the hash table can hold a chain of nodes. self.index refers to the index of the chain in which the node was just located, or -1 if the node was not found. Therefore, the statement "self.index refers to the index of the chain in which the node was just located, or is -1 otherwise" is true for a chaining implementation of a set.

In the Hashing Implementation of a Set, Self