Chapter 17, Problem 3PE

Program Plan Intro

Binary tree

Program plan:

BinaryTree.java

• Create a class named “BinaryTree”. Inside the class,
  • Define the required variables
  • Define the “BinaryTree ()” methods.
    • Initialize the node values.
    • Define and assign the values.
  • Define the class “Node()” methods.
    • Initialize the required values.
    • Define the method “swap()”.
      • Define the variables
      • Condition to compare the values.
      • Return the values
        • Define the method “levelPrint ()”
        • • Define the queue.
          • Add the values
          • Use loop and condition to compare the values.
          • Print the results
        • Define the method “height()” method
        • • Condition to validate the node value
          • Return the height.
        • Define the method “isEmpty()”
        • • Assign the value of the root
        • Define the “data()”
        • • Return the value
        • Define the “left()”
        • • Initialize the method
          • Return the result
        • Define the “right()”
        • • Initialize the method
          • Return the result

TreeTester.java

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