
Chapter 10
Linked Lists
10.1 Introduction
A linked list is a data structure that consists of a sequence of data items of the
same or similar types and each data item or node has one or more links to another
node. 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 because once it is created, more elements cannot
be added or removed.
This chapter discusses the basic forms of simple linked lists, double-ended linked
lists, ...