Abstract
In operations on dynamic data structures (e.g., linked list), manipulating the first node should often be treated specially. Head nodes are used to deal with this problem. Unfortunately, the unused head-nodes are appendices too. They make other trouble in using the structures. In this paper, we use a number of examples to illustrate a technique to handle the problem: using static, temporary head nodes in operations on dynamic data structures. With this technique, definitions of operations on dynamic data structures may become simpler and clearer.
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 callDisclaimer: 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.
