Chapter 17, Problem 6PE

Program Plan Intro

Binary Search Tree

Program plan:

BinarySearchTree.java

• Create a class named “BinarySearchTree”. Inside the class,
  • Define the required variables
  • Define the  class“BinarySearchTree ()” methods.
    • Define and assign the values.
  • Define the method “add()” methods.
    • Initialize the required values.
    • Define the “addNode()”
      • Use condition to compare the parent node.
      • Return the parent node
        • Define the “find()”
        • • Assign the root value
          • Loop that iterates to find the values
        • Define the “remove()”
        • • Initialize the required values
          • Loop that iterates for the values to remove the values.
          • Use conditions to compare the values for removing the required value.
        • Define the “print()”
        • • Display the values.
        • Define the class Node
        • • Declare the required values.

SmallestTester.java

• Create a class named “TreeTester”. Inside the class,
  • Define the method “main ()”
    • Define the object
    • Assign the values to the list.
    • Display the required contents.