Balancing methods for binary search trees

Authors:
James Michael Cannady
Affiliations:
N.C. State
Venue:
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
Year:
1978

Citing 6
Cited 0

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)
A comparison of tree-balancing algorithms

Communications of the ACM
Performance of height-balanced trees

Communications of the ACM
Optimizing binary trees grown with a sorting algorithm

Communications of the ACM
A generalization of AVL trees

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary search trees have received a great deal of attention in recent years. As a result of this interest, several methods have been developed for balancing them; namely, random, height-balanced, bounded-balance, and weight-balanced trees. These methods which include weighted and non-weighted binary search trees are grouped into two classes: 1) dynamic balancing and 2) total restructuring. The rational and properties of the more significant methods are discussed and compared with other tree balancing algorithms. These comparisons provide insight about the conditions under which an algorithm is appropriate.