Prove that the depth of a random binary search tree (depth of the deepest node)
Chapter 4, Problem 4.17(choose chapter or problem)
Prove that the depth of a random binary search tree (depth of the deepest node) isO(logN), on average.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer