Skip to main content
SpringerLink
Log in

Balance in AVL trees

  • Algorithms And Complexity
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '91 (ICCI 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 497))

Included in the following conference series:

  • 155 Accesses

Abstract

We characterize a family of AVL trees that have the maximum numbers of unbalanced nodes, nodes whose subtrees differ in height by one, for their heights and weights.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Brown. A partial analysis of random height-balanced trees. SIAM Journal on Computing, 8(1):33–41, February 1979.

    Article  Google Scholar 

  2. Ricardo A. Baeza-Yates, Gaston H. Gonnet, and Nivio Ziviani. Expected behaviour analysis of AVL trees. To appear, 1989.

    Google Scholar 

  3. Helen Cameron and Derick Wood. Unbalanced AVL trees and space pessimal brother trees. Research Report CS-89-20, University of Waterloo, 1989.

    Google Scholar 

  4. Donald E. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

  5. Rolf Klein and Derick Wood. On the space cost of brother trees or: How unbalanced can an AVL tree be? See also Knuth, Vol. 3, page 470, Exercise 3, 1987.

    Google Scholar 

  6. Rolf Klein and Derick Wood. On the path length of binary trees. Journal of the Association for Computing Machinery, 36(2):280–289, 1989.

    Google Scholar 

  7. Rolf Klein and Derick Wood. A tight upper bound for the path length of AVL trees. Theoretical Computer Science, 72:251–264, 1990.

    Article  Google Scholar 

  8. C. G. Lekkerkerker. Voorstelling van natuurlijke getallen door een som van getallen van fibonacci. Simon Stevin, 29:190–195, 1952.

    Google Scholar 

  9. K. Mehlhorn. A partial analysis of height-balanced trees. Report A 79/13, Universität des Saarlandes, Saarbrucken, West Germany, 1979.

    Google Scholar 

  10. K. Mehlhorn. A partial analysis of height-balanced trees under random insertions and deletions. SIAM Journal on Computing, 11:748–760, 1982.

    Article  Google Scholar 

  11. Thomas Ottmann, D. Stott Parker, Arnold L. Rosenberg, Hans-Werner Six, and Derick Wood. Minimal-cost brother trees. SIAM Journal on Computing, 13(1):197–217, 1984.

    Article  Google Scholar 

  12. Thomas Ottmann and Hans W. Six. Eine neuen Klasse von ausgeglichen Binärbäumen. Angewandte Informatik, 9:395–400, 1976.

    Google Scholar 

  13. T. Ottmann and D. Wood. 1–2 brother trees or AVL trees revisited. The Computer Journal, 23(3):248–255, August 1980.

    Google Scholar 

  14. Andrew Chi-Chih Yao. On random 2–3 trees. Acta Informatica, 9:159–170, 1978.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data Structuring Group Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Helen Cameron & Derick Wood

Authors
  1. Helen Cameron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Derick Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cameron, H., Wood, D. (1991). Balance in AVL trees. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_161

Download citation

  • DOI: https://doi.org/10.1007/3-540-54029-6_161

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54029-8

  • Online ISBN: 978-3-540-47359-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation