Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1989: Algorithms and Data Structures pp 393–402Cite as

Improving partial rebuilding by using simple balance criteria

  • Conference paper
  • First Online:

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

Abstract

Some new classes of balanced trees, defined by very simple balance criteria, are introduced. Those trees can be maintained by partial rebuilding at lower update cost than previously used weight-balanced trees. The used balance criteria also allow us to maintain a balanced tree without any balance information stored in the nodes.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. M. Adelson-Velski and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2), 162.

    Google Scholar 

  2. J-L. Baer and B. Schwab. A comparison of tree-balancing algorithms. Communications of the ACM, 20(5), 1977.

    Google Scholar 

  3. R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4), 1972.

    Google Scholar 

  4. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 1975.

    Google Scholar 

  5. M. R. Brown. Addentum to a storage scheme for height-balanced trees. Information Processing Letters, 8(3), 1979.

    Google Scholar 

  6. H. A. Mauer, Th. Ottman, and H. W. Six. Implementing dictionaries using binary trees of very small height. Information Processing Letters, 5(1), 1976.

    Google Scholar 

  7. J. Nievergelt and E. M. Reingold. Binary trees of bounded balance. SIAM Journal on Computing, 2(1), 1973.

    Google Scholar 

  8. H. J. Olivie. A new class of balanced search trees: Half-balanced binary search trees. R.A.I.R.O. Informatique Theoretique, 16:51–71, 1982.

    Google Scholar 

  9. M. H. Overmars. The Design of Dynamic Data Structures. Springer Verlag, 1983. ISBN 3-540-12330-X.

    Google Scholar 

  10. M. H. Overmars and J. van Leeuwen. Dynaimc multi-dimensional data structures based on quad-and k-d trees. Acta Informatica, 17, 1982.

    Google Scholar 

  11. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3), 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Lund, Sweden

    Arne Andersson

Authors
  1. Arne Andersson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andersson, A. (1989). Improving partial rebuilding by using simple balance criteria. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation