Java Reference
In-Depth Information
Linked Data
Structures
15
15.1 JAVA LINKED LISTS
804
Example: A Simple Linked List Class 804
Working with Linked Lists 808
Node Inner Classes 814
Example: A Generic Linked List 817
The
equals
Method for Linked Lists 822
15.5 HASH TABLES WITH CHAINING
866
A Hash Function for Strings 867
Efficiency of Hash Tables 870
15.6 SETS
871
Fundamental Set Operations 872
Efficiency of Sets Using Linked Lists 877
15.2 COPY CONSTRUCTORS AND
THE
Clone
METHOD
★
824
Simple Copy Constructors and
clone
Methods
15.7 TREES
878
Tree Properties 878
Example: A Binary Search Tree Class
★
881
★
824
Efficiency of Binary Search Trees
★
886
Exceptions
825
Example: A Linked List with a
Deep Copy
clone
Method
★
★
832
15.3 ITERATORS
835
Defining an Iterator Class 836
Adding and Deleting Nodes 841
15.4 VARIATIONS ON A LINKED LIST
846
Doubly Linked List 846
The Stack Data Structure 855
The Queue Data Structure 857
Running Times and Big-
O
Notation 860
Efficiency of Linked Lists 865
Chapter Summary 887
Answers to Self-Test Exercises 888
Programming Projects 893
