The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Insertions and deletions in one-sided height-balanced trees
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
A compendium of key search references
ACM SIGIR Forum
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
Communications of the ACM
One-sided height-balanced search trees
ACM SIGACT News
Tree Search in Major/Minor Loop Magnetic Bubble Memories
IEEE Transactions on Computers
| Hi-index | 48.27 |
A one-sided height-balanced tree is a binary tree in which every node's right subtree has a height which is equal to or exactly one greater than the height of its left subtree. It has an advantage over the more general AVL tree in that only one bit of balancing information is required (two bits are required for the AVL tree).It is shown that deletion of an arbitrary node of such a tree can be accomplished in O(log n) operations, where n is the number of nodes in the tree. Moreover the method is optimal in the sense that its complexity cannot be reduced in order of magnitude. This result, coupled with earlier results by Hirschberg, indicates that, of the three basic problems of insertion, deletion, and retrieval, only insertion is adversely affected by this modification of an AVL tree.