Copy the binary tree Program Plan: Declare the header file section. Create a template prefix and define the template class IntBinaryTree to perform the following functions: Declare the required variables. Declare the function prototypes. Define the no-argument generic constructor IntBinaryTree () to initialize the root value as null. Define destructor for IntBinaryTree () class and call the function destroySubTree() to destroy the sub tree. Call the functions insertNode(),displayInOrder(), and remove(). Declare the overloaded assignment operator for binary tree. Define the generic function insert () to insert the node in pointed by the tree node pointer in a tree. Define the generic copy constructor for IntBinaryTree class to copy the binary tree using copyTree() function. Define the generic function insert () to insert the node in pointed by the tree node pointer in a tree. Define the generic function insertNode() to create a new node and it is passed inside the insert() function to insert a new node into the tree. Define the generic function destroySubTree() to delete the left and right subtree. Define the generic function remove()which calls deleteNode() to delete the node. Define the generic function deleteNode()which delete the node stored in the variable num and it calls the makeDeletion() function to delete a particular node passed inside the argument. Define the generic function makeDeletion()which takes the reference to a pointer to delete the node and the brances of the tree corresponding below the node are reattached. Define the generic function displayInOrder()to display the values in the subtree pointed by the node pointer. Define the generic function copyTree()to copy the entire binary tree. In main() function , Create two binary trees with integer data type to hold the integer values. Call the function insertNode() to insert some nodes into tree. Using assignment operator assign one tree into another tree using respective variables. Call the function displayInOrder() to display the nodes in order for tree1 and tree 2. Create another object for IntBinaryTree class and copy the tree1 to tree3 using copy constructor and display the tree using displayInOrder() function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 21, Problem 6PC

Program Plan Intro

Copy the binary tree

Program Plan:

Declare the header file section.

Create a template prefix and define the template class IntBinaryTree to perform the following functions:

Declare the required variables.

Declare the function prototypes.

Define the no-argument generic constructor IntBinaryTree () to initialize the root value as null.

Define destructor for IntBinaryTree () class and call the function destroySubTree() to destroy the sub tree.

Call the functions insertNode(),displayInOrder(), and remove().

Declare the overloaded assignment operator for binary tree.

Define the generic function insert () to insert the node in pointed by the tree node pointer in a tree.

Define the generic copy constructor for IntBinaryTree class to copy the binary tree using copyTree() function.

Define the generic function insert () to insert the node in pointed by the tree node pointer in a tree.

Define the generic function insertNode() to create a new node and it is passed inside the insert() function to insert a new node into the tree.

Define the generic function destroySubTree() to delete the left and right subtree.

Define the generic function remove()which calls deleteNode() to delete the node.

Define the generic function deleteNode()which delete the node stored in the variable num and it calls the makeDeletion() function to delete a particular node passed inside the argument.

Define the generic function makeDeletion()which takes the reference to a pointer to delete the node and the brances of the tree corresponding below the node are reattached.

Define the generic function displayInOrder()to display the values in the subtree pointed by the node pointer.

Define the generic function copyTree()to copy the entire binary tree.

In main() function,

Create two binary trees with integer data type to hold the integer values.

Call the function insertNode() to insert some nodes into tree.

Using assignment operator assign one tree into another tree using respective variables.

Call the function displayInOrder() to display the nodes in order for tree1 and tree 2.

Create another object for IntBinaryTree class and copy the tree1 to tree3 using copy constructor and display the tree using displayInOrder() function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Change the following code so that there is always at least one way to get from the left corner to the top right, but the labyrinth is still randomized. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. Take care that the player and the dragon cannot start off on walls. Also the dragon starts off from a randomly chosen position public class Labyrinth { private final int size; private final Cell[][] grid; public Labyrinth(int size) { this.size = size; this.grid = new Cell[size][size]; generateLabyrinth(); } private void generateLabyrinth() { Random rand = new Random(); for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) { // Randomly create walls and paths grid[i][j] = new Cell(rand.nextBoolean()); } } // Ensure start and end are…

Change the following code so that it checks the following 3 conditions: 1. there is no space between each cells (imgs) 2. even if it is resized, the components wouldn't disappear 3. The GameGUI JPanel takes all the JFrame space, so that there shouldn't be extra space appearing in the frame other than the game. Main(): Labyrinth labyrinth = new Labyrinth(10); Player player = new Player(9, 0); Dragon dragon = new Dragon(9, 9); JFrame frame = new JFrame("Labyrinth Game"); GameGUI gui = new GameGUI(labyrinth, player, dragon); frame.add(gui); frame.setSize(600, 600); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.setVisible(true); public class GameGUI extends JPanel { private final Labyrinth labyrinth; private final Player player; private final Dragon dragon; //labyrinth, player, dragon are just public classes private final ImageIcon playerIcon = new ImageIcon("data/images/player.png");…

Make the following game user friendly with GUI, with some simple graphics. The GUI should be in another seperate class, with some ImageIcon, and Game class should be added into the pane. The following code works as this: The objective of the player is to escape from this labyrinth. The player starts at the bottom left corner of the labyrinth. He has to get to the top right corner of the labyrinth as fast he can, avoiding a meeting with the evil dragon. The player can move only in four directions: left, right, up or down. There are several escape paths in all labyrinths. The player’s character should be able to moved with the well known WASD keyboard buttons. If the dragon gets to a neighboring field of the player, then the player dies. Because it is dark in the labyrinth, the player can see only the neighboring fields at a distance of 3 units. Cell Class: public class Cell { private boolean isWall; public Cell(boolean isWall) { this.isWall = isWall; } public boolean isWall() { return…