Skip to main content
SpringerLink
Log in

Nearly optimal binary search trees

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We discuss two simple strategies for constructing binary search trees: “Place the most frequently occurring name at the root of the tree, then proceed similary on the subtrees “and” choose the root so as to equalize the total weight of the left and right subtrees as much as possible, then proceed similarly on the subtres.” While the former rule may yield extremely inefficient search trees, the latter rule always produces nearly optimal trees.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fredman, M. L.: Two applications of a probabilistic search technique: Sorting X + Y and building balanced search trees. 7th ACM Symposium on Theory of Computing, Albuquerque, 1975

  2. Hu, T. C., Tan, K. C.: Least upper bound on the cost of optimum binary search trees. Acta Informatica 1, 307–310 (1972)

    Google Scholar 

  3. Kameda, T., Weihrauch, K.: Einführung in die Kodierungstheorie I. BI Skripten zur Informatik, Vol. 7. Mannheim: Bibliographisches Institut 1971

    Google Scholar 

  4. Knuth, D. E.: Optimum binary search trees. Acta Informatica 1, 14–25 (1971)

    Google Scholar 

  5. Knuth, D. E.: The art of computer programming, Vol. 3. Reading (Mass.): Addison-Wesley 1973

    Google Scholar 

  6. Rissanen, J.: Bounds for weighted balanced trees. IBM J. Res. Develop. March 1973, 101–105

  7. Walker, W. A., Gotlieb, C. C.: A top-down algorithm for constructing nearly optimal lexicographical trees, in Graph theory and Computing. New York: Academic Press 1972

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 10, Universität des Saarlandes, D-6600, Saarbrücken, Federal Republic of Germany

    Kurt Mehlhorn

Authors
  1. Kurt Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mehlhorn, K. Nearly optimal binary search trees. Acta Informatica 5, 287–295 (1975). https://doi.org/10.1007/BF00264563

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264563

Keywords

Search

Navigation