Skip to main content
SpringerLink
Log in

Reflections on Optimal and Nearly Optimal Binary Search Trees

  • Chapter
Book cover Efficient Algorithms

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5760))

  • 2289 Accesses

Abstract

We take a rather informal look at the development of techniques for finding optimal and near optimal binary search trees. The point of view is both that of the “early” development of the field and as a set of wonderful examples for teaching algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mehlhorn, K.: Best possible bounds for the weighted path length of optimum binary search trees. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 31–41. Springer, Heidelberg (1975)

    Google Scholar 

  2. Mehlhorn, K., Galil, Z.: Monotone switching circuits and boolean matrix product. In: Becvár, J. (ed.) MFCS 1975. LNCS, vol. 32, pp. 315–319. Springer, Heidelberg (1975)

    Google Scholar 

  3. Mehlhorn, K.: Nearly optimal binary search trees. Acta Inf. 5, 287–295 (1975)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. III. Addison-Wesley, Reading (1973)

    MATH  Google Scholar 

  6. Huffman, D.A.: A method for the construction of minimum-redundanct codes. Proceedings of the IRE 40(9), 1098–1101 (1952)

    Article  Google Scholar 

  7. Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. The Bell System Technical Journal 38, 933–968 (1959)

    Article  MathSciNet  Google Scholar 

  8. Younger, D.H.: Context-free language processing in time n 3. In: FOCS, pp. 7–20. IEEE, Los Alamitos (1966)

    Google Scholar 

  9. Younger, D.H.: Recognition and parsing of context-free languages in time n 3. Information and Control 10(2), 189–208 (1967)

    Article  MATH  Google Scholar 

  10. Hu, T.C., Tucker, A.C.: Optimal computer search trees and variable-length alphabetical codes. SIAM J. on Applied Math. 21(4), 514–532 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  11. Garsia, A.M., Wachs, M.L.: A new algorithm for minimum cost binary trees. SIAM J. Comput. 6(4), 622–642 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  12. Walker, W.A., Gotlieb, C.C.: A top-down algorithm for constructing nearly optimal lexicographical trees. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 303–323 (1972)

    Google Scholar 

  13. Bayer, P.J.: Improved Bouonds on the Costs of OPtimal and Balanced Binary Search Trees. MAC Technical Memorandum 69, ans M.Sc. Thesis, M.I.T. (1975)

    Google Scholar 

  14. Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM J. Comput. 6(2), 235–239 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  15. Allen, B.: On the costs of optimal and near-optimal binary search trees. Acta Inf. 18, 255–263 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  16. Fredman, M.L.: Two applications of a probabilistic search technique: Sorting x + y and building balanced search trees. In: STOC, pp. 240–244. ACM, New York (1975)

    Google Scholar 

  17. DePrisco, R., DeSantis, A.: On binary search trees. Inf. Process. Lett. 45(5), 249–253 (1993)

    Article  MathSciNet  Google Scholar 

  18. DePrisco, R., DeSantis, A.: New lower bounds on the cost of binary search trees. Theor. Comput. Sci. 156(1&2), 315–325 (1996)

    Article  MathSciNet  Google Scholar 

  19. Bose, P., Douïeb, K.: Efficient construction of near-optimal binary and multiway search trees. To appear Proc. Algorithms and Data Structures Symposium (WADS) (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    J. Ian Munro

Authors
  1. J. Ian Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Georges-Köhler-Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Institut für Informatik, Freie Universität Berlin, Takustr. 9, 14195, Berlin, Germany

    Helmut Alt

  3. Fachbereich IV - Informatik, Universität Trier, 54286, Trier, Germany

    Stefan Näher

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Munro, J.I. (2009). Reflections on Optimal and Nearly Optimal Binary Search Trees. In: Albers, S., Alt, H., Näher, S. (eds) Efficient Algorithms. Lecture Notes in Computer Science, vol 5760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03456-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03456-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03455-8

  • Online ISBN: 978-3-642-03456-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation