In Which Collision-Avoidance Hashing Strategy Are the Items Stored in an Array

question 19

Multiple Choice

In which collision-avoidance hashing strategy are the items stored in an array of linked lists in which each item's key locates the bucket where the item is to be inserted?

• A) clustering
• B) chaining
• C) quadratic probing
• D) linear probing