Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
What is the expected time of inserting n keys into a skip list or treap?
A
O(n log n) expected
B
O(n) worst case
C
O(n^2) expected
D
O(log n) total