The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
On Foster's information storage and retrieval using AVL trees
Communications of the ACM
Communications of the ACM
BLISS: a language for systems programming
Communications of the ACM
A balanced tree storage and retrieval algorithm
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
An insertion algorithm for a minimal internal path length binary search tree
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
CSC '93 Proceedings of the 1993 ACM conference on Computer science
ACM Computing Surveys (CSUR)
Balancing binary trees by internal path reduction
Communications of the ACM
An optimal insertion algorithm for one-sided height-balanced binary search trees
Communications of the ACM
An optimal method for deletion in one-sided height-balanced trees
Communications of the ACM
Communications of the ACM
An insertion technique for one-sided height-balanced trees
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
Rebalancing Height Balanced Trees
IEEE Transactions on Computers
Lookup table powered neural event-driven simulator
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Comparative performance evaluation of the AVL and red-black trees
Proceedings of the Fifth Balkan Conference in Informatics
| Hi-index | 48.32 |
This paper presents the results of simulations that investigate the performance of height-balanced (HB[k]) trees. It is shown that the only statistic of HB[1] trees (AVL trees) that is a function of the size of the tree is the time to search for an item in the tree. For sufficiently large trees, the execution times of all procedures for maintaining HB[1] trees are independent of the size of the tree. In particular, an average of .465 restructures are required per insertion, with an average of 2.78 nodes revisited to restore the HB[1] property; an average of .214 restructures are required per deletion, with an average of 1.91 nodes revisited to restore the HB[1] property. Moreover, the execution times of procedures for maintaining HB[k] trees, for k 1, are also independent of the size of the tree except for the average number of nodes revisited on a delete operation in order to restore the HB[k] property on traceback. The cost of maintaining HB[k] trees drops sharply as the allowable imbalance (k) increases. Both analytical and experimental results that show the cost of maintaining HB[k] trees as a function of k are discussed.