
C H A P T E R 10
Linked Lists
10.1 INTRODUCTION
A linked list is a data structure that consists of a seq ue nce of data items of
the same or similar types and each data item or node has one o r 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 ar ray 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 bas ic forms of simple linked lists, double-ended ...