General Balanced Trees

Journal of Algorithms

Volumn 30, Issue 1, 1999, Pages 1-18

  Andersson, Arne ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010837979     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0967     Document Type: Article

References (25)

1. G. M. Adelson-Velskii and E. M. Landis, An algorithm for the organization of information, Dokl. Akad. Nauk SSSR 146(2) (1962), 1259-1262.
2. A. Andersson, Improving partial rebuilding by using simple balance criteria, in "Proc. Workshop on Algorithms and Data Structures," pp. 393-402, Springer-Verlag, Berlin/New York, 1989.
3. A. Andersson, Maintaining a-balanced trees by partial rebuilding, Internat. J. Comput. Math. 38 (1990), 37-48.
4. A. Andersson, Ch. Icking, R. Klein, and Th. Ottmann, Binary search trees of almost optimal height, Acta Inform. 28 (1990), 165-178.
5. J-L. Baer and B. Schwab, A comparison of tree-balancing algorithms, Comm. ACM 20(5) (1977), 322-330.
6. R. Bayer, Symmetric binary B-trees: Data structure and maintenance algorithms, Acta Inform. 1(4) (1972), 290-306.
7. J. L. Bentley, Multidimensional binary search trees used for associative searching, Comm. ACM 18(9) (1975), 509-517.
8. M. R. Brown, A storage scheme for height-balanced trees, Inform. Process. Lett. 7(5), (1978), 231-232.
9. M. R. Brown, Addendum to "A storage scheme for height-balanced trees," Inform. Process. Lett. 8(3) (1979), 154-156.
10. H. Chang and S. S. Iynegar, Efficient algorithms to globally balance a binary search tree, Comm. ACM 27(7) (1984), 695-702.
11. A. C. Day, Balancing a binary tree, Comput. J. 19(4) (1976), 360-361.
12. C. C. Foster, A generalization of AVL-trees, Comm. ACM, 16(8) (1973), 513-517.
13. I. Galperin and R. L. Rivest, Scapegoat trees, in "Proceedings of The Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993," p. 165-174.
14. L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, in "Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science, 1978," p. 8-21.
15. D. E. Knuth, "The Art of Computer Programming," Vol. 3, "Sorting and Searching," Addison-Wesley, Reading, MA, 1973. (ISBN 0-201-03803-X.)
16. S. R. Kosaraju, Insertion and deletion in one-sided height-balanced trees, Comm. ACM, 21 (1978), 226-227.
17. W. A. Martin and D. N. Ness, Optimizing binary trees grown with a sorting algorithm, Comm. ACM 15(2) (1972), 88-93.
18. H. A. Maurer, Th. Ottmann, and H. W. Six, Implementing dictionaries using binary trees of very small height, Inform. Process. Lett. 5(1) (1976), 11-14.
19. K. Mehlhorn, "Data Structures and Algorithms 1: Sorting and Searching," Springer-Verlag, Berlin/New York, 1984. (ISBN 3-540-13302-X.)
20. J. Nievergelt and E. M. Reingold, Binary trees of bounded balance, SIAM J. Comput. 2(1) (1973), 33-43.
21. H. J. Olivie, "A Study of Balanced Binary Trees and Balanced One-Two-Trees," Ph.D. thesis, Department of Mathematics, University of Antwerp, 1980.
22. M. H. Overmars, "The Design of Dynamic Data Structures," Lecture Notes in Computer Science, Vol. 156, Springer-Verlag, Berlin/New York, 1983. (ISBN 3-540-12330-X.)
23. M. H. Overmars and J. van Leeuwen, Dynamic multi-dimensional data structures based on quad- and k-d trees, Acta Inform. 17 (1982), 267-285.
24. D. D. Sleator and R. E. Tarjan, Self-adjusting binary search trees, J. Assoc. Comput. Mach. 32(3) (1985), 652-686.
25. Q. F. Stout and B. L. Warren, Tree rebalancing in optimal time and space, Comm. ACM 29(9) (1986), 902-908.