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

Consider the following relations: Student(snum: integer, sname: string, rmajor: string, level: string, age: integer) Class(cname: string, meets_at: time, room: string, fid: integer) Enrolled(snum: integer, cname: string) Faculty(fid: integer, fname: string, deptid: integer) The meaning of these relations is straightforward; for example, Enrolled has one record per student-class pair such that the student is enrolled in the class. 2. Express each of the following integrity constraints in SQL unless it is implied by the primary and foreign key constraint; if so, explain how it is implied. If the constraint cannot be expressed in SQL, say so. For each constraint, state what operations (inserts, deletes, and updates on specific relations) must be monitored to enforce the constraint. (a) Every faculty member must teach at least two courses. (b) Every student must be enrolled in the course called 'Math101'. (c) A student cannot add more than two courses at a time…

Consider the following relational schema. An employee can work in more than one department; the pct_time field of the Works relation shows the percentage of time that a given employee works in a given department. Emp(eid: integer, ename: string, age: integer, salary: real) Works(eid: integer, did: integer, pct_time: integer) Dept(did: integer, budget: real, managerid: integer) Write the following queries in SQL: a. Print the name of each employee whose salary exceeds the budget of all of the departments that he or she works in. b. Find the enames of managers who manage only departments with budgets larger than $1 million, but at least one department with budget less than $5 million.

Consider the following schema: Suppliers(sid: integer, sname: string, address: string) Parts(pid: integer, pname: string, color: string) Catalog(sid: integer, pid: integer, cost: real) The Catalog relation lists the prices charged for parts by suppliers. Write the following queries in SQL: a. Find the sids of suppliers who charge more for some part than the average cost of that part (averaged over all the suppliers who supply that part). b. Find the sids of suppliers who supply a red part or a green part. c. For every supplier that supplies a green part and a red part, print the name and price of the most expensive part that she supplies.