Java™ How to Program, Seventh Edition

Summary

Section 17.1 Introduction

• Dynamic data structures can grow and shrink at execution time.

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

• Stacks are important in compilers and operating systems—insertions and deletions are made only at one end of a stack, its top.

• Insertions are made at the tail of a queue and deletions are made from the head.

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

Section 17.2 Type-Wrapper Classes for Primitive Types

• Type-wrapper classes (e.g., Integer, Double, Boolean) enable programmers ...