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 method for deletion in one-sided height-balanced trees
Communications of the ACM
An insertion technique for one-sided height-balanced trees
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A compendium of key search references
ACM SIGIR Forum
An optimal insertion algorithm for one-sided height-balanced binary search trees
Communications of the ACM
On B-trees: routing schemes and concurrency
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
One-sided height-balanced search trees
ACM SIGACT News
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
Tree Search in Major/Minor Loop Magnetic Bubble Memories
IEEE Transactions on Computers
| Hi-index | 48.24 |
Insertion and deletion algorithms are provided for the class of right (or one-sided) brother trees which have O (log n) performance. The importance of these results stems from the close relationship of right brother trees to one-sided height-balanced trees which have an insertion algorithm operating in O (log2 n). Further, although both insertion and deletion can be carried out in O (log n) time for right brother trees, it appears that the insertion algorithm is inherently much more difficult than the deletion algorithm—the reverse of what one usually obtains.