Applies the basic data structures to the management of dynamic memory
Presents alternative ways to structure the collection of unused memory locations
two-way circular lists
the buddy system
indexing methods
Discusses problems that arise when structures share storage
Explains fundamental techniques for reclaiming unused storage
Illustrates data abstraction and functional modularization in the development of three stackless binary tree traversals
Calls attention to the problems of
garbage generation
dangling references
13.1: The Need for Storage Management
13.2: The Heap or Dynamic Memory
13.3: The List of Available Space for Variable-Length Records
13.5: Storage Reclamation Techniques
13.7: Pitfalls: Garbage Generation and Dangling References