ACM

Communications of the ACM

Home/Magazine Archive/March 1978 (Vol. 21, No. 3)/Insertions and deletions in one-sided height-balanced.../Abstract

Insertions and deletions in one-sided height-balanced trees

By S. Rao Kosaraju
Communications of the ACM, March 1978, Vol. 21 No. 3, Pages 226-227
10.1145/359361.359366
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.