Insertions and deletions in one-sided height-balanced trees

Authors:
S. Rao Kosaraju
Affiliations:
The John Hopkins Univ., Baltimore, MD
Venue:
Communications of the ACM
Year:
1978

Citing 2
Cited 5

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 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
An optimal method for deletion in one-sided height-balanced trees

Communications of the ACM
Tree Search in Major/Minor Loop Magnetic Bubble Memories

IEEE Transactions on Computers

Quantified Score

Hi-index	48.27

Visualization

Abstract

Recently Hirschberg has established that insertions into one-sided height-balanced trees can be done in O(log2N) steps. It is proved here that deletions can also be performed in O(log2N) steps, which answers the open problem posed by Hirschberg.