Abstract
We begin the series of list modules by presenting an implementation of the simplest, most basic list structure: the singly-linked unbounded list.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Booch, Software Components with Ada, Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.
G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, London England 1984.
D. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addison-Wesley, Reading, MA 1973.
R. Wiener and R. Sincovec, Data Structures Using Modula-2, John Wiley & Sons, New York, NY 1986, pg. 198.
N. Wirth, Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ 1986.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Lins, C. (1989). Singly-Linked Unbounded List. In: The Modula-2 Software Component Library. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-6396-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6396-5_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-6398-9
Online ISBN: 978-1-4684-6396-5
eBook Packages: Springer Book Archive