Chapter 17, Problem 1PP

Program Plan Intro

Implementing binary tree

Program plan:

BinaryTree.java:

• Define a class “BinaryTree”
  • Declare the variable root using Node.
  • Define the “Visitor()” interface.
    • Define a “visit()” method to visit the data.
  • Define a “Node” class.
    • Declare the variables.
    • Define a “size()” function.
      • This computes the size of the subtree.
  • Define a BinaryTree() constructor.
    • This generates an empty tree.
  • Define a parameterized constructor “BinaryTree()”.
    • This generates a tree with one node.
  • Define a “addSubtree()” method.
    • This function adds a node to the subtree.
  • Define a “size()” function.
    • This computes the size of the tree.
    • Returns the number of nodes in the tree.
  • Define a “inorder()” function for both one node and multiple node.
    • This orders the tree in inorder manner.

TreeTester.java:

• Define a class “TreeTester”.
  • Define “main()”
    • Create objects for “BinaryTree”.
    • Adding nodes to “BinaryTree”.
    • Printing the size of tree using “size()” function.
    • Call the “Inorder()” function and printing the tree in inorder form.