Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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)
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 1977
Knuth, D.: Fundamental Algorithms. (The Art of Computer Programming vol. 1), Addison-Wesley, 1968
Knuth, D.: Sorting and Searching. (The Art of Computer Programming vol. 3), Addison-Wesley, 1973
Mehlhorn, K.: Private communication (to Y. Horibe)
Mehlhorn, K.: Nearly optimal binary search trees, Acta Informatica 5, 287–295 (1975)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Horibe, Y., Nemetz, T.O.H. On the max-entropy rule for a binary search tree. Acta Informatica 12, 63–72 (1979). https://doi.org/10.1007/BF00264017
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264017