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