Linked lists

  • Joés M. Garrido


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.


Data Item Data Object Object Reference Linked List Node Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.Department of Computer & Information SystemsKennesaw State UniversityKennesawUSA

Personalised recommendations