2k views

Given a binary search trees for a set of n=5 keys with the following probabilities:

 i 0 1 2 3 4 5 $p_i$ - 0.15 0.1 0.5 0.1 0.2 $q_i$ 0.05 0.1 0.05 0.05 0.05 0.1

The expected optimal cost of the search is

1. 2.65
2. 2.70
3. 2.75
4. 2.80
in DS | 2k views
+1
0

Veteran Kindly explain how u have calculated

by Veteran (432k points)
0

arjun sir,how to calculate depth(Ki) or depth(di) here..??as we are not given BST

0
0
How??
by Active (4.8k points)
0
plz explain how to calculate