Practice
Learn
← Quit
0 / 0 correct
Data Structures
Medium
1 of 40
What is the worst-case search time in an unbalanced binary search tree, and when does it happen?
A
O(n log n), when there are duplicates
B
O(log n), always
C
O(1), when the tree is full
D
O(n), for example when keys are inserted in sorted order