Program Plan: Include the required import statement. Define the main class. Define the main method using public static main. Allocate memory to the class “Test”. Define the “Test” class. Declare the object for the BST. Call the “preorderIterator”. The “while” condition is used to iterate the element. Display the result Define the “BST” class. Declare the required variables. Create a default BST class. Create a binary tree from an array of objects. Define the “search” method. Start the traverse from the root of the tree. If the search element is in the left subtree set that value in “current” variable otherwise set the “current” variable as right subtree value. Define the “insert” method. If the root is null create the tree otherwise insert the value into left or right subtree. Define the “createNewNode” Return the result of new node creations. Define the “inorder” Inorder traverse from the root. Define the protected “inorder” method Traverse the tree according to the inorder traversal concept. Define the “postorder” Postorder traverse from the root. Define the protected “postorder” method Traverse the tree according to the postorder traversal concept. Define the “preorder” Preorder traverse from the root. Define the protected “preorder” method Traverse the tree according to the preorder traversal concept. Define the “TreeNode” class Declare the required variables. Define the constructor. Define the “getSize” method. Return the size. Define the “getRoot” method Return the root. Define the “java.util.ArrayList” method. Create an object for the array list. If the “current” is not equal to null, add the value to the list. If the “current” is less than 0, set the “current” as left subtree element otherwise set the “current” as right subtree element. Return the list. Define the “delete” method. If the “current” is not equal to null, add the value to the list. If the “current” is less than 0, delete the “current” as left subtree element otherwise delete the “current” as right subtree element. Return the list. Define the “iterator” method. Call the “inorderIterator” and return the value. Define the “inorderIterator” Create an object for that method and return the value Define the “inorderIterator” class. Declare the variables. Define the constructor. Call the “inorder” method. Define the “inorder” method. Call the inner “inorder” method with the argument. Define the TreeNode “inorder” method. If the root value is null return the value, otherwise add the value into the list. Define the “hasNext” method If the “current” value is less than size of the list return true otherwise return false. Define the “next” method Return the list. Define the “remove” method. Call the delete method. Clear the list then call the “inorder” method. Define the “clear” method Set the values to the variables Define the “preorderIterator” class which is derived from the “java.util.Iterator”. Declare and store the element into the list. Inside the constructor call the “preorder” method. Define the “preorder” method. If the “root” is equal to null return the value. Otherwise, add the element into the list and call the “preorder” method for adding element into the left and right subtree. Define the “hasNext” method If the “current” value is less than size of the list return true otherwise return false. Define the “next” method Return the list. Define the “remove” method. Call the delete method. Clear the list then call the “inorder” method. Define the interface. Declare the required methods. Define the required methods.

Question

Want to see the full answer?

Answer 1

Question

Chapter 25, Problem 25.10PE

Program Plan Intro

Program Plan:

Include the required import statement.

Define the main class.

Define the main method using public static main.

Allocate memory to the class “Test”.

Define the “Test” class.

Declare the object for the BST.

Call the “preorderIterator”.

The “while” condition is used to iterate the element.

Display the result

Define the “BST” class.

Declare the required variables.

Create a default BST class.

Create a binary tree from an array of objects.

Define the “search” method.

Start the traverse from the root of the tree.

If the search element is in the left subtree set that value in “current” variable otherwise set the “current” variable as right subtree value.

Define the “insert” method.

If the root is null create the tree otherwise insert the value into left or right subtree.

Define the “createNewNode”

Return the result of new node creations.

Define the “inorder”

Inorder traverse from the root.

Define the protected “inorder” method

Traverse the tree according to the inorder traversal concept.

Define the “postorder”

Postorder traverse from the root.

Define the protected “postorder” method

Traverse the tree according to the postorder traversal concept.

Define the “preorder”

Preorder traverse from the root.

Define the protected “preorder” method

Traverse the tree according to the preorder traversal concept.

Define the “TreeNode” class

Declare the required variables.

Define the constructor.

Define the “getSize” method.

Return the size.

Define the “getRoot” method

Return the root.

Define the “java.util.ArrayList” method.

Create an object for the array list.

If the “current” is not equal to null, add the value to the list.

If the “current” is less than 0, set the “current” as left subtree element otherwise set the “current” as right subtree element.

Return the list.

Define the “delete” method.

If the “current” is not equal to null, add the value to the list.

If the “current” is less than 0, delete the “current” as left subtree element otherwise delete the “current” as right subtree element.

Return the list.

Define the “iterator” method.

Call the “inorderIterator” and return the value.

Define the “inorderIterator”

Create an object for that method and return the value

Define the “inorderIterator” class.

Declare the variables.

Define the constructor.

Call the “inorder” method.

Define the “inorder” method.

Call the inner “inorder” method with the argument.

Define the TreeNode “inorder” method.

If the root value is null return the value, otherwise add the value into the list.

Define the “hasNext” method

If the “current” value is less than size of the list return true otherwise return false.

Define the “next” method

Return the list.

Define the “remove” method.

Call the delete method.

Clear the list then call the “inorder” method.

Define the “clear” method

Set the values to the variables

Define the “preorderIterator” class which is derived from the “java.util.Iterator”.

Declare and store the element into the list.

Inside the constructor call the “preorder” method.

Define the “preorder” method.

If the “root” is equal to null return the value.

Otherwise, add the element into the list and call the “preorder” method for adding element into the left and right subtree.

Define the “hasNext” method

If the “current” value is less than size of the list return true otherwise return false.

Define the “next” method

Return the list.

Define the “remove” method.

Call the delete method.

Clear the list then call the “inorder” method.

Define the interface.

Declare the required methods.

Define the required methods.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(10 points) Consider a new secondary method for the Statement component family. Complete the code of the WHILE and CALL cases in the implementation of the instance method aggression below. You may assume that the code for the other cases has already been written. /** * Switches all skip calls with infect calls. * * @ensures * public void aggression () { switch (this.kind ()) { // assume code for BLOCK, IF, and IF ELSE cases already implemented case WHILE: { } this = [#this with skip replaced by infect] } break; case CALL: { break; The del default: { // this will never happen break;

Tape for a Turing Machine (Doubly-linked List)”.(I USE ECLIPSE & RUN CHECK ONLINE CONSOLE)A class named Tape to represent Turing machine tapes. The class should have an instance variable of type Cell that points to the current cell with the method: public Cell getCurrentCell() -- returns the pointer that points to the current cell. public char getContent() -- returns the char from the current cell. public void setContent(char ch) -- changes the char in the current cell to the specified value. Don't forget the Javadoc comments. IT WOULD HAVE A PUBLIC CLASS public void moveLeft() -- moves the current cell one position to the left along the tape. Note that if the current cell is the leftmost cell that exists, then a new cell must be created and added to the tape at the left of the current cell, and then the current cell pointer can be moved to point to the new cell. The content of the new cell should be a blank space. (Remember that the Turing machine's tape is conceptually…

(Triangle class) Design a new Triangle class that extends the abstract GeometricObject class. Draw the UML diagram for the classes Triangle and GeometricObject and then implement the Triangle class. Write a test program that prompts the user to enter three sides of the triangle, a colour, and a Boolean value to indicate whether the triangle is filled. The program should create a Triangle object with these sides and set the colour and filled properties using the input. The program should display the area, perimeter, colour, and true or false to indicate whether it is filled or not.