1.

What is the expected depth of a node in a randomized binary search tree?

A. log n
B. n!
C. n2
D. 2 log n + O(1)
Answer» E.


Discussion

No Comment Found