Improving Partial Rebuilding by Using Simple Balance Criteria
暂无分享,去创建一个
[1] Mark R. Brown. Addendum to “a storage scheme for height-balanced trees” , 1979 .
[2] Edward M. Reingold,et al. Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..
[3] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .
[4] Henk J. Olivié,et al. A New Class of Balanced Search Trees: Half Balanced Binary Search Trees , 1982, RAIRO Theor. Informatics Appl..
[5] Mark H. Overmars,et al. The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.
[6] Hermann A. Maurer,et al. Implementing Dictionaries Using Binary Trees of Very Small Height , 1976, Inf. Process. Lett..
[7] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[8] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[9] Jean-Loup Baer,et al. A comparison of tree-balancing algorithms , 1977, CACM.