Estimate expected comparisons in a BST

Q: Estimate expected comparisons in a BST

This is a Coding & Algorithms interview question from Optiver for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

In a particular binary search tree, finding node A takes 1 comparison and finding node D takes 3 comparisons. What is the expected number of comparisons to find a uniformly random node in this tree? State assumptions and justify your estimate.

Estimate expected comparisons in a BST

Comments (0)