Abstract
A linked list is a data structure that stores a collection of data items of the same or similar types. This data structure is dynamic in the sense that the number of data items can change. A linked list can grow and shrink during the execution of the program that is manipulating it. Recall that an array is also a data structure that stores a collection of data items, but the array is static; once it is created, more elements cannot be added to it. Linked lists and arrays are considered low-level data structures that are used to implement higher-level data structures, such as stacks and queues that are manipulated by an appropriate algorithm. This chapter explains in some detail the basic forms of simple linked lists, double-ended linked lists, and multiple linked lists. The operations possible on linked lists and some applications that manipulate linked lists are also discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag US
About this chapter
Cite this chapter
Garrido, J. (2009). Linked lists. In: Object Oriented Simulation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0516-1_19
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0516-1_19
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0515-4
Online ISBN: 978-1-4419-0516-1
eBook Packages: Computer ScienceComputer Science (R0)