New Lower Bounds on the Cost of Binary Search Trees

In this paper we provide new lower bounds on the cost C of binary search trees. The bounds are expressed in terms of the entropy H of the probability distribution, the number of elements and the probability that a search is successful. Most of our lower bounds are derived by means of a new technique which exploits the relation between trees and codes. Our… CONTINUE READING