C++ How to Program, 10/e

Summary

Section 19.1 Introduction

• Dynamic data structures (p. 798) grow and shrink during execution.

• Linked lists (p. 798) are collections of data items “lined up in a row”—insertions and removals are made anywhere in a linked list.

• Stacks (p. 798) are important in compilers and operating systems: Insertions and removals are made only at one end of a stack—its top (p. 798).

• Queues (p. 798) represent waiting lines; insertions are made at the back (also referred to as the tail; p. 798) of a queue and removals are made from the front (also referred to as the head; p. 798).

• Binary trees (p. 798) facilitate high-speed searching and sorting of data, efficient duplicate elimination, representation of file-system directories and compilation of expressions ...