Communications of the ACM

Home/Magazine Archive/August 1976 (Vol. 19, No. 8)/An insertion technique for one-sided height-balanced.../Abstract

An insertion technique for one-sided height-balanced trees

By D. S. Hirschberg
Communications of the ACM, August 1976, Vol. 19 No. 8, Pages 471-473
10.1145/360303.360334
Comments

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

A restriction on height-balanced binary trees is presented. It is seen that this restriction reduces the extra memory requirements by half (from two extra bits per node to one) and maintains fast search capabilities at a cost of increased time requirements for inserting new nodes.

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.