Skip to main content
SpringerLink
Log in

A New Method for Balancing Binary Search Trees

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

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

Included in the following conference series:

Abstract

A new balancing method for binary search trees is presented, which achieves logarithmic worst-case cost on searches and updates. The method uses the sizes of the subtrees as balancing information; therefore operations by rank are efficiently performed without any changes in the data structure. Compared to weighted binary search trees [7], which also achieve logarithmic worst-case cost by making use of the sizes of the subtrees, the operations involved with our method are likely to be less costly in most real situations.

This research was partially supported by the IST Programme of the EU IST-1999-14186 (ALCOM-FT), and by the project DGES PB98-0926 (AEDRI).

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. G.M. Adel’son-Vel’skii and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2):263–266, 1962. English translation in Soviet Math. Doklay 3, 1259-1263, 1962.

    MathSciNet  Google Scholar 

  2. A. Andersson. General balanced trees. Journal of Algorithms, 30:1–18, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Blum and K. Mehlhorn. On the average number of rebalancing operations in weight-balanced trees. TCS: Theoretical Computer Science, 11:303–320, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  4. L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 8–21, October 1978.

    Google Scholar 

  5. D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, MA, 2nd edition, 1998.

    Google Scholar 

  6. C. Martínez and S. Roura. Randomized binary search trees. Journal of the ACM, 45(2):288–323, March 1998.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Nievergelt and E. Reingold. Binary search trees of bounded balance. SIAM Journal on Computing, 2(1):33–43, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Sedgewick. Algorithms in C. Addison-Wesley, 3rd edition, 1998.

    Google Scholar 

  9. D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652–686, July 1985.

    Article  MATH  MathSciNet  Google Scholar 

  10. M.A. Weiss. Data Structures ℰ Algorithm Analysis in C++. Addison-Wesley, 2nd edition, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament de LSI, Universitat Politècnica de Catalunya, E-08028, Barcelona, Catalonia, Spain

    Salvador Roura

Authors
  1. Salvador Roura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informátics, Univ. Politècnica de Catalunya, C/Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  2. Computer Technology Institute (CTI), University of Patras, 61 Riga Feraiou street, 26221, Patras, Greece

    Paul G. Spirakis

  3. Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roura, S. (2001). A New Method for Balancing Binary Search Trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation