Advertisement

Improving partial rebuilding by using simple balance criteria

  • Arne Andersson
Conference paper
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Binary Tree Balance Tree Binary Search Tree Lower Node Information Processing Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    J-L. Baer and B. Schwab. A comparison of tree-balancing algorithms. Communications of the ACM, 20(5), 1977.Google Scholar
  3. [3]
    R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4), 1972.Google Scholar
  4. [4]
    J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 1975.Google Scholar
  5. [5]
    M. R. Brown. Addentum to a storage scheme for height-balanced trees. Information Processing Letters, 8(3), 1979.Google Scholar
  6. [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. [7]
    J. Nievergelt and E. M. Reingold. Binary trees of bounded balance. SIAM Journal on Computing, 2(1), 1973.Google Scholar
  8. [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. [9]
    M. H. Overmars. The Design of Dynamic Data Structures. Springer Verlag, 1983. ISBN 3-540-12330-X.Google Scholar
  10. [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. [11]
    D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3), 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Arne Andersson
    • 1
  1. 1.Department of Computer ScienceLund UniversityLundSweden

Personalised recommendations