Algorithms & data structures
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An optimal insertion algorithm for one-sided height-balanced binary search trees
Communications of the ACM
Insertions and deletions in one-sided height-balanced trees
Communications of the ACM
An optimal method for deletion in one-sided height-balanced trees
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
An insertion technique for one-sided height-balanced trees
Communications of the ACM
On Foster's information storage and retrieval using AVL trees
Communications of the ACM
Communications of the ACM
Data Structure Techniques
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
An insertion algorithm for a minimal internal path length binary search tree
Communications of the ACM
Fringe analysis of binary search trees with miniml internal path length
CSC '91 Proceedings of the 19th annual conference on Computer Science
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
IEEE Transactions on Knowledge and Data Engineering
A comparison of two algorithms for multi-unit k-double auctions
ICEC '03 Proceedings of the 5th international conference on Electronic commerce
Data structures from an empirical standpoint
Journal of Computing Sciences in Colleges
Nordic Journal of Computing
| Hi-index | 48.23 |
We present an algorithm for balancing binary search trees. In this algorithm single or double rotations are performed when they decrease the internal path of the total tree. It is shown that the worst internal path on such trees is never more than 5 percent worse than optimal and that its height is never more than 44 percent taller than optimal. This compares favorably with the AVL trees whose internal path may be 28 percent worse than optimal and the same 44 percent worst height, and with the weight-balanced trees which may be 15 and 100 percent worse than optimal, respectively. On the other hand, the number of rotations during a single insertion/deletion can be O(n), although the amortized worst-case number of rotations is O(log n) per update.