Data Structures | Binary Search Trees | Question 12

Last Updated :
Discuss
Comments

Consider the following Binary Search Tree
 

 

If we randomly search one of the keys present in above BST, what would be the expected number of comparisons?

2.75

2.25

2.57

3.25

This question is part of this quiz :

Top MCQs on Binary Search Tree (BST) Data Structure with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy