Updating Almost Complete Trees or One Level Makes All the Difference
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[2] Arne Andersson,et al. Improving Partial Rebuilding by Using Simple Balance Criteria , 1989, WADS.
[3] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .
[4] Jan van Leeuwen,et al. Dynamization of Decomposable Searching Problems , 1980, Inf. Process. Lett..
[5] Quentin F. Stout,et al. Tree rebalancing in optimal time and space , 1986, CACM.
[6] Edward M. Reingold,et al. Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..
[7] Mark H. Overmars,et al. The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.
[8] Thomas E. Gerasch,et al. An insertion algorithm for a minimal internal path length binary search tree , 1988, CACM.