Tree rebalancing in optimal time and space
暂无分享,去创建一个
[1] Jeffrey L Eppinger,et al. An empirical study of insertion and deletion in binary search trees , 1983, Commun. ACM.
[2] Donald E. Knuth,et al. Sorting and Searching , 1973 .
[3] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .
[4] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .
[5] S. Sitharama Iyengar,et al. Efficient algorithms to globally balance a binary search tree , 1984, CACM.
[6] William A. Martin,et al. Optimizing binary trees grown with a sorting algorithm , 1972, CACM.
[7] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[8] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .