What Is The Longest Length Path For A Node X In Random Binary Search Tree For The Insertion Process?

› Category: Questions › What is the longest length path for a node x in random binary search tree for the insertion process?

0 Vote Up Vote Down

Editor">

Editor Staff asked 5 months ago

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.

Question Tags: Interview-Questions-Answers

1 Answers

0 Vote Up Vote Down

Editor">

Editor Staff answered 5 months ago

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 Posts

Most commonly asked OpenAI interview questions and answers

Common AI interview questions and answers:

How do you uninstall gulp?