+1 vote
in Data Structures & Algorithms I by (110k points)
What is the longest length path for a node x in random binary search tree for the insertion process?

(a) log x

(b) x^2

(c) x!

(d) 4.311 log x

My enquiry is from Binary Trees in division Binary Trees of Data Structures & Algorithms I

I got this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (d) 4.311 log x

Best explanation: Although it is difficult to find the length of the longest path in randomized binary search tree, but it has been found that the longest length is around 4.311 log x.

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.