TREE REBALANCING IN OPTIMAL TIME AND SPACE

被引:22
作者
STOUT, QF [1 ]
WARREN, BL [1 ]
机构
[1] EASTERN MICHIGAN UNIV,DEPT MATH,YPSILANTI,MI 48197
关键词
D O I
10.1145/6592.6599
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:902 / 908
页数:7
相关论文
共 6 条
[1]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[2]   EFFICIENT ALGORITHMS TO GLOBALLY BALANCE A BINARY SEARCH TREE [J].
CHANG, H ;
IYENGAR, SS .
COMMUNICATIONS OF THE ACM, 1984, 27 (07) :695-702
[3]  
DAY AC, 1976, COMPUT J, V19, P360, DOI 10.1093/comjnl/19.4.360
[4]   AN EMPIRICAL-STUDY OF INSERTION AND DELETION IN BINARY SEARCH-TREES [J].
EPPINGER, JL .
COMMUNICATIONS OF THE ACM, 1983, 26 (09) :663-669
[5]  
Knuth D. E., 1973, ART COMPUTER PROGRAM
[6]   OPTIMIZING BINARY TREES GROWN WITH A SORTING ALGORITHM [J].
MARTIN, WA ;
NESS, DN .
COMMUNICATIONS OF THE ACM, 1972, 15 (02) :88-&