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.

Question

Want to see the full answer?

Answer 1

Question

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.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Answer the question fully and accurately by providing the required files(Java Code, Two output files and written answers to questions 1-3 in a word document)meaning question 1 to 3 also provide correct answers for those questions.(note: this quetion is not graded).

.NET Interactive Solving Sudoku using Grover's Algorithm We will now solve a simple problem using Grover's algorithm, for which we do not necessarily know the solution beforehand. Our problem is a 2x2 binary sudoku, which in our case has two simple rules: •No column may contain the same value twice •No row may contain the same value twice If we assign each square in our sudoku to a variable like so: 1 V V₁ V3 V2 we want our circuit to output a solution to this sudoku. Note that, while this approach of using Grover's algorithm to solve this problem is not practical (you can probably find the solution in your head!), the purpose of this example is to demonstrate the conversion of classical decision problems into oracles for Grover's algorithm. Turning the Problem into a Circuit We want to create an oracle that will help us solve this problem, and we will start by creating a circuit that identifies a correct solution, we simply need to create a classical function on a quantum circuit that…