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

Abstract classes & Interfaces (Ch13) 5. See the code below and solve the following. class Circle { protected double radius; // Default constructor public Circle() ( } this(1.0); // Construct circle with specified radius public Circle(double radius) { } this.radius radius; // Getter method for radius public double getRadius() { } return radius; // Setter method for radius public void setRadius(double radius) { } this.radius = radius; // Implement the findArea method defined in GeometricObject public double findArea() { } return radius* radius * Math. PI; // Implement the find Perimeter method defined in GeometricObject public double findPerimeter() { } return 2*radius*Math.PI; // Override the equals() method defined in the Object class public boolean equals(Circlel circle) { } return this.radius == circle.getRadius(); // Override the toString() method defined in the Object class public String toString() { } } return "[Circle] radius = " + radius; 5-1. Define a class name…

6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]

Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4