On the max-entropy rule for a binary search tree
A modified max-entropy rule is proposed for constructing nearly optimum binary search tree in the case of ordered keys with given probabilities. The average cost of the trees obtained by this rule is shown to be bounded by the entropy of the probability distribution plus a constant not larger than one. An algorithm for implementing this rule is then suggested and its complexity is investigated in a probabilistic setting.
KeywordsInformation System Probability Distribution Operating System Data Structure Communication Network
Unable to display preview. Download preview PDF.
- 1.Güttler, R., Mehlhorn, K., Schneider, W.: Binary Search Trees: Average and Worst Case Behavior, submitted to Acta Informatica. (a preliminary version appeared in Informatik-Fachberichte vol. 5, 301–317, Springer-Verlag, 1976)Google Scholar
- 2.Horibe, Y.: Entropy and Balance in Binary Trees, Colloque International du C.N.R.S. held at E.N.S.E.T., Cachan, France, July 1977Google Scholar
- 3.Knuth, D.: Fundamental Algorithms. (The Art of Computer Programming vol. 1), Addison-Wesley, 1968Google Scholar
- 4.Knuth, D.: Sorting and Searching. (The Art of Computer Programming vol. 3), Addison-Wesley, 1973Google Scholar
- 5.Mehlhorn, K.: Private communication (to Y. Horibe)Google Scholar