Table of Contents

  1. Introduction
  2. The Tree ADT
    1. Representation and Implementation
    2. Tree Terminology
    3. Tree Height
    4. Paths within a Tree
    5. Structure of Trees
    6. Structural Features
  3. Structural Definition of Binary Trees
    1. The Binary Tree
    2. The Binary Search Tree
    3. Search Algorithms
  4. Tree Traversal
    1. Pre-Order Traversal
    2. Post-Order Traversal
    3. In-Order or Infix Order Traversal
    4. Breadth-First Traversal
  5. Design and Implementation of the Interface
    1. Create Algorithm
    2. IsEmpty Algorithm
    3. InsertData(Tree t , Node n) Algorithm
    4. DeleteData(Tree t, Node n) Algorithm
    5. Deleting Non-Leaf Nodes
    6. Finding the Successor of a Node
    7. Moving a Node
    8. Removing Successor with Right Child
    9. Traversal Operations
  6. Recursion
    1. Recursive Solutions
    2. Recursion and Binary Trees
    3. Implementation and use of Recursive Algorithms
  7. Coding the Interface and Operations for a Binary Search Tree
    1. Get Operations
    2. Set Operations
    3. Java Code for Binary Trees
    4. Binary Tree Operations
    5. More Operations
    6. Display Routines
    7. Insert Operation
    8. Search Routine
    9. Get Successor
    10. Delete
  8. Testing the Interface of the Binary Tree