**Prove that the depth of a random binary search tree (depth of the deepest node) is O(log N), on average.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.