Linked Data Structures - Java - page 743

15.1 Java Linked Lists 806

Example: A Simple Linked List Class 806

15

Working with Linked Lists 810

Node Inner Classes 816

Example: A Generic Linked List 819

The Method for Linked Lists 825 equals

15.2 Copy Constructors and the

★

Method 826 clone

★ Simple Copy Constructors and Methods 827 clone

★

Exceptions 827

Linked Data
Structures

Example: A Linked List with a Deep Copy 834

★

Method clone

15.3 Iterators 838

Defining an Iterator Class 839

Adding and Deleting Nodes 844

15.4 Variations on a Linked List 847

Doubly Linked List 849

The Stack Data Structure 858

The Queue Data Structure 860

Running Times and Big- O Notation 863

Efficiency of Linked Lists 868

15.5 Hash Tables with Chaining 869

A Hash Function for Strings 870

Efficiency of Hash Tables 874

15.6 Sets 875

Fundamental Set Operations 875

Efficiency of Sets Using Linked Lists 880

15.7 Trees 881

Tree Properties 882

★

Example: A Binary Search Tree Class 884

★

Efficiency of Binary Search Trees 890

Chapter Summary 891

Answers to Self-Test Exercises 892

Programming Projects 897