Java™ How To Program (Early Objects), Tenth Edition

Section 21.1 Introduction

• Dynamic data structures (p. 870) can grow and shrink at execution time.

• Linked lists (p. 870) are collections of data items “linked up in a chain”—insertions and deletions can be made anywhere in a linked list.

• Stacks (p. 870) are important in compilers and operating systems—insertions and deletions are made only at the top (p. 870) of a stack.

• In a queue, insertions are made at the tail (p. 870) and deletions are made from the head (p. 870).

• Binary trees (p. 870) facilitate high-speed searching and sorting, eliminating duplicate data items efficiently, representing file-system directories and compiling expressions into machine language.