Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 105
What is Robin Hood hashing?
A
Chaining with balanced trees
B
Hashing with a random seed per lookup
C
An open addressing scheme where an inserting key displaces a resident key that is closer to its ideal slot, evening out probe lengths
D
Stealing buckets from other tables