Communications of the ACM

Home/Magazine Archive/April 1977 (Vol. 20, No. 4)/Remark on uniform insertion in structured data structures/Abstract

Remark on uniform insertion in structured data structures

By Clifford R. Hollander
Communications of the ACM, April 1977, Vol. 20 No. 4, Pages 261-262
10.1145/359461.359476
Comments

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

In a recent paper, Shneiderman and Scheuermann [1] have defined an interesting operation, called uniform insertion, whereby a (linked) data structure G2 can be embedded within another structure G1 in such a way that each data node of G1 serves as an entry node for G2. This communication points out and corrects an error in their definition, while preserving the spirit of that operation.

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.