Skip to main content
SpringerLink
Log in

Least upper bound on the cost of optimum binary search trees

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

This paper gives the least upper bound on the weighted path length of an optimum lexicographic (alphabetic) binary search tree as a function of n, given the total weight of the n terminal nodes and the n—1 internal nodes to be one.

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. Crane, C. A.: Linear lists and priority queues as balanced binary trees. Stanford University Ph. D. Thesis. 1972.

  2. Hu, T. C., Tucker, A. C.: Optimal computer search trees and variable-length alphabetical code. SIAM Journal on Applied Mathematics 21, 514–532 (1971).

    Google Scholar 

  3. Hu, T. C., Tan, K. C.: Path length of binary search trees. SIAM Journal on Applied Mathematics 22, 225–234 (1972).

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Research Center University of Wisconsin, 53706, Madison, Wisconsin, USA

    T. C. Hu

  2. Department of Industrial Engineering and Management Sciences, The Technological Institute Northwestern · University, 60201, Evanston, Illinois, USA

    K. C. Tan

Authors
  1. T. C. Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. C. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was sponsored by the United States Army under Contract No.: DA-31-124-ARO-D-462, and National Science Foundation Grant GJ-28339.

Rights and permissions

Reprints and permissions

About this article

Cite this article

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

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation