Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 680
What does a consistent hash ring store to look up a key's node in O(log n)?
A
A full table of all keys
B
A sorted array of node hash positions; binary search for the first position ≥ hash(key), wrapping around
C
A linked list of keys
D
A hash map from key to node