Java Reference
In-Depth Information
A Binary
Search Tree
Implementation
Chapter
25
Contents
Getting Started
An Interface for the Binary Search Tree
Duplicate Entries
Beginning the Class Definition
Searching and Retrieving
Traversing
Adding an Entry
A Recursive Implementation
An Iterative Implementation
Removing an Entry
Removing an Entry Whose Node Is a Leaf
Removing an Entry Whose Node Has One Child
Removing an Entry Whose Node Has Two Children
Removing an Entry in the Root
A Recursive Implementation
An Iterative Implementation
The Efficiency of Operations
The Importance of Balance
The Order in Which Nodes Are Added
An Implementation of the ADT Dictionary
Prerequisites
Appendix C
Creating Classes from Other Classes
Chapter
7
Recursion
Chapter
19
Dictionaries
Chapter
23
Trees
Chapter
24
Tree Implementations
