Skip to main content
Conference ProceedingsOPEN ACCESS

Best possible bounds on the weighted path length of optimum binary search trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1975) 33 LNCS 31-41
DOI: 10.1007/3-540-07407-4_4
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Mehlhorn, K. (1975). Best possible bounds on the weighted path length of optimum binary search trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 33 LNCS, pp. 31–41). Springer Verlag. https://doi.org/10.1007/3-540-07407-4_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free