Abstract
We derive upper and lower bounds for the weighted path length Popt of optimum binary search trees. In particular, 1/log3 H≤Popt≤2+H where H is the entropy of the frequency distribution. We also present an approximation algorithm which constructs nearly optimal trees.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
E.N. Gilbert and E.F. Moore: Bell System Techn. Journal 38 (1959), 933–968.
T.C. Hu and K.C. Tan: Least Upper Bound on the Cost of Optimum Binary Search Trees, Acta Informatica, 1, 307–310 (1972).
T.C. Hu and A.C. Tucker: Optimal Computer Search Trees and variable length alphabetic codes, Siam J. Applied Math. 21, 514–532, (1971).
T. Kameda and K. Weihrauch: Einführung in die Kodierungstheorie, B I Skripten zur Informatik, Vol. 7.
D.E. Knuth: Optimum Binary Search Trees, Acta Informatica, 1, 14–25, 1971.
D.E. Knuth: The Art of Computer Programming, Vol. 3.
K. Mehlhorn: Nearly Optimum Binary Search Trees, Preprint, Fachbereich 10, Universität des Saarlandes, 1974.
C.P. Schnorr: Two Algorithms for Nearly Optimal Binary Search Trees, Preprint, Fachbereich Mathematik, Universität Frankfurt, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehlhorn, K. (1975). Best possible bounds on the weighted path length of optimum binary search trees. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive