Maintaining α-balanced trees by partial rebuilding

References

• Andersson , A. 1989 . Proc. Workshop on Algorithms and Data Structures, WADS '89 . Improving partial rebuilding by using simple balance criteria . 1989 , Ottawa. pp. 393 – 402 .
   Google Scholar
• Anderson , A. , Icking , Ch. , Klein , R. and Ottmann , Th. Binary search trees of almost optimal height . Act Informatica ,
   Web of Science ®Google Scholar
• Bayer , R. 1972 . Symmetric binary B-trees: Data structure and maintenance algorithms . Acta Informatica , 1 ( 4 )
   Google Scholar
• Bentley , J. L. 1975 . Multidimensional binary search trees used for associative searching . Communications of the ACM , 18 ( 9 )
   Web of Science ®Google Scholar
• Change , H. and Iynegar , S. S. 1984 . Efficient algorithms to globally balance a binary search tree . ACM , 27 ( 7 )
   Web of Science ®Google Scholar
• Day , A. C. 1976 . Balancing a binary tree . Computer Journal , 19 ( 4 )
   Web of Science ®Google Scholar
• Martin , W. A. and Ness , D. N. 1972 . Optimizing binary trees grown with a sorting algorithm . Communications of the ACM , 15 ( 2 )
   Web of Science ®Google Scholar
• Nievergelt , J. and Reingold , E. M. 1973 . Binary trees of bounded balance . SIAM Journal on Computing , 2 ( 1 ) : 33 – 43 .
   Google Scholar
• Olivie H. J. A Study of Balanced Binary Trees and Balanced One-Two-Trees Dept. of Mathematics, University of Antwerp 1980 Ph. D. Thesis
   Google Scholar
• Olivie , H. J. 1982 . A new class of balanced search trees: Half-balanced binary search trees . R. A. I. R. O. Informatique Theoretique , 16 : 51 – 71 .
   Web of Science ®Google Scholar
• Ottmann , Th. and Wood , D. 1990 . Proc. Scandinavian Workshop on Algorithm Theory, SWAT '90 . Updating binary trees with constant linkage cost . 1990 , Bergen.
   Google Scholar
• Overmars , M. H. 1983 . “ The Design of Dynamic Data Structures ” . In Lecture Notes in Computer Science , Vol. 156 , Springer Verlag . ISBN 3-540-12330-X
   Google Scholar
• Overmars , M. H. and van Leeuwen , J. 1982 . Dynamic multi-dimensional data structures based on quad- and k-d trees . Acta Informatica , 17 : 267 – 285 .
   Web of Science ®Google Scholar
• Stout , Q. F. and Warren , B. L. 1986 . Tree rebalancing in optimal time and space . Communications of the ACM , 29 ( 9 )
   Web of Science ®Google Scholar