Description: Up to this point, we have assumed that an optimal search tree is one in which the probability of occurrence of all keys is
equal (or is unknown, in which case we assume it to be equal). Thus we concentrated on balancing the tree so as to
make the cost of finding any key at most log n.
To Search:
File list (Check if you may need any files):
binary tree.txt
Download