Data Structures | Binary Search Trees | Question 12

Consider the following Binary Search Tree


               10
             /    \
            5      20
           /      /  \           
          4     15    30
               /  
              11       

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

(A) 2.75
(B) 2.25
(C) 2.57
(D) 3.25


Answer: (C)

Explanation: Expected number of comparisons = (1*1 + 2*2 + 3*3 + 4*1)/7 = 18/7 = 2.57

Quiz of this Question



My Personal Notes arrow_drop_up



Practice Tags :

Recommended Posts:



4.3 Average Difficulty : 4.3/5.0
Based on 3 vote(s)






User Actions