The expected average depth of a binary search tree built by uniformly random…
ISRO Scientist/Engineer SC · 2011 · Computer ScienceModified — slightly modified from the official paper; see the solution
The expected average depth of a binary search tree built by uniformly random insertion is:
- A.
O(n0.5)
- B.
O(n)
- C.
O(log n)
- D.
O(n log n)
Attempted by 1747 students.
Show answer
Correct answer: C
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…