info@avatto.com
+91-9920808017
0. Let n = 4 and (a1, a2, a3, a4) = (do, if, int, while).Let p(1 : 4) = (3 / 8, 3 / 8, 1 /8, 1 / 8) and Let q(1 : 4) = (2 / 8, 3 / 8, 1 / 8, 1 / 8, 1 / 8) where p(i) and q(i) denotes the probability with which we search a and the identifier x being searched satisfy ai < x < ai+1 respectively. The optimal search tree is given by (1) (2) (3) (4)
1
2
3
4
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
(2) 
(3) 
(4) 
You must be logged in to post a comment.