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
A balanced tree storage and retrieval algorithm
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Introduction to Computer Organization and Data Structures
Introduction to Computer Organization and Data Structures
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
A compendium of key search references
ACM SIGIR Forum
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
Balancing binary trees by internal path reduction
Communications of the ACM
A comparison of tree-balancing algorithms
Communications of the ACM
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
Balancing methods for binary search trees
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
An empirical evaluation of algorithms for dynamically maintaining binary search trees
ACM '80 Proceedings of the ACM 1980 annual conference
On the development of data structures
ACM SIGPLAN Notices
Rebalancing Height Balanced Trees
IEEE Transactions on Computers
Tree Search in Major/Minor Loop Magnetic Bubble Memories
IEEE Transactions on Computers
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
On the Height of Height-Balanced Trees
IEEE Transactions on Computers
| Hi-index | 48.29 |
A generalization of AVL trees is proposed in which imbalances up to &Dgr; are permitted, where &Dgr; is a small integer. An experiment is performed to compare these trees with standard AVL trees and with balanced trees on the basis of mean retrieval time, of amount of restructuring expected, and on the worst case of retrieval time. It is shown that, by permitting imbalances of up to five units, the retrieval time is increased a small amount while the amount of restructuring required is decreased by a factor of ten.A few theoretical results are derived, including the correction of an earlier paper, and are duly compared with the experimental data. Reasonably good correspondence is found.0