Abstract
In a recent paper, Shneiderman and Scheuermann [1] have defined an interesting operation, called uniform insertion , whereby a (linked) data structure G 2 can be embedded within another structure G 1 in such a way that each data node of G 1 serves as an entry node for G 2 . This communication points out and corrects an error in their definition, while preserving the spirit of that operation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
