Given a binary search trees for a set of n=5 keys with the following probabilities:
The expected optimal cost of the search is
@ Kapil Veteran Kindly explain how u have calculated
Directly taken from here,
http://www.cs.ntou.edu.tw/lincc/courses/al99/pdf/Algorithm-Ch15-Dynamic%20Programming-4.pdf
arjun sir,how to calculate depth(K_{i}) or depth(d_{i}) here..??as we are not given BST