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.
Insertions and deletions in one-sided height-balanced trees
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment