+1 vote
in Data Structures & Algorithms I by (110k points)
What is the expected depth of a node in a randomized binary search tree?

(a) log n

(b) n!

(c) n^2

(d) 2 log n + O(1)

Asked question is from Binary Trees topic in section Binary Trees of Data Structures & Algorithms I

This question was posed to me in quiz.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct choice is (d) 2 log n + O(1)

For explanation: The expected value of depth of a node that is for a node a, the expected value of length of path from root to node a is found to be at most 2 log n + O(1).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...