The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Balancing binary trees by internal path reduction
Communications of the ACM
Communications of the ACM
Balancing methods for binary search trees
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
ACM '78 Proceedings of the 1978 annual conference
An empirical evaluation of algorithms for dynamically maintaining binary search trees
ACM '80 Proceedings of the ACM 1980 annual conference
Performance analysis of BSTs in system software
Proceedings of the joint international conference on Measurement and modeling of computer systems
Concurrent Search and Insertion in AVL Trees
IEEE Transactions on Computers
Comparative performance evaluation of the AVL and red-black trees
Proceedings of the Fifth Balkan Conference in Informatics
| Hi-index | 48.25 |
Several algorithms — height-balance (i.e. AVL and extensions), weight-balance (i.e. BB and WB), and total restructuring — for building balanced binary search trees are compared. The criteria for comparison encompass theoretical aspects (e.g. path lengths) and implementation independent and machine/algorithm-dependent measures (e.g. run time). A detailed analysis of code is also presented at a level believed to be language- and compiler-independent. The quality of the resulting trees and the overhead spent on building them are analyzed, and some guidelines are given for an efficient use of the methods. If insertion and subsequent queries are the only operations of interest, then “pure” AVL trees present the overall best qualities.