
1096 CHAPTER 14 An Introduction to Data Structures
CHAPTER SUMMARY
14.13 Chapter Summary
■
A data structure is a mechanism for organizing the data a program
stores in memory.
■
A linked list is a data structure consisting of nodes linked together
like a chain.
■
Typical instance variables for a node are an object reference to the
data stored at the node, and a node reference, which points to the
next node in the list.
■
Because each node has a reference to the next node as an instance
variable, a linked list needs only one instance variable, its first node,
which is usually called head. Often, for convenience, we also include
an instance variable representing ...