Practice
Learn
← Quit
0 / 0 correct
Data Structures
Easy
1 of 10
What are the average and worst-case lookup times of a hash table?
A
O(1) in all cases
B
O(n) average, O(n log n) worst case
C
O(log n) average, O(n) worst case
D
O(1) average, O(n) worst case