Chapter 17, Problem 9PE

Program Plan Intro

Adding elements to the tree in depth first manner

Program plan:

Tree.java:

• Define the class “Tree”.
• Declare the private variable root from class “Node”.
• Define the class “Node”.
  • It holds data and List of nodes.
  • Define the “size()” function.
    • Returns the number of nodes in the subtree.
• Define “Tree()” constructor
  • Generate an empty tree.
• Define “Tree()” with one parameter.
  • Generate a tree with one root node and no children.
• Define “addSubree()” method.
  • Adds a subtree as last node.
• Define “size()”.
  • Computes the size of the tree.
• Define the “preorder()” method for both tree with many nodes and a tree with one node.
  • Traverses the tree in preorder.
    • “preorder(root,v)” is called.
  • For a tree with multiple nodes,
    • Traverse the tree with given root node.
• Define the “depthFirst()” method.
  • Traversing the tree in depth first manner.
  • “ArrayList” is used to store the elements.

Visitor.java:

• Define interface “Visitor”
  • Calls the “visit(object data)”

BinaryTreeTester.java:

• Import the required header files.
• Define “DepthFirstTester” class.
  • Define the “main()” function.
    • Create objects “t1” as root node and “t2,t3,t4,t5,t6,t7” as subtree.
    • Create object for interface using lambda expression.
    • Call the “depthFirst()” method using “t1”.
    • Print the output.