created: 01/17/2003

# CHAPTER 35 — Linked Lists

Dynamic memory allocation is most frequently used to build data structures. The previous chapter described linked lists. This chapter shows how that idea can be implemented with dynamic memory.

#### Chapter Topics:

- Linked list nodes.
- Allocating memory for a node.
- The current node.
- Creating a linked list using a loop.
- Printing a linked list.

### QUESTION 1:

(Review: ) Except for the first and last item, each data item in an ordered list has one ____________ and one ____________.