bartleby

Concept explainers

Question
Book Icon
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.

Blurred answer
Students have asked these similar questions
Subject: Database management system Explain in easy way with write  handwritten note   Test if the following schedule is conflict serializable or not and explain R1 (A), R2 (D), W1 (B), R2 (B), W3 (B), R4 (B), W2 (C), R5 (C), W4 (E), R5 (E), W5 (B).
Subject: Database management system Explain in easy way with write  handwritten note   Test if the following schedule is conflict serializable or not and explain R1 (A), R2 (D), W1 (B), R2 (B), W3 (B), R4 (B), W2 (C), R5 (C), W4 (E), R5 (E), W5 (B).
Subject: Database management system Explain in easy way with write  handwritten note a. What is lossy decomposition? Check whether the following decompositions are lossy or lossless. (i) Let R=ABCD, R1 = AD, R2 = AB, R3 = BE, R4 = CDE, R5 = AE, F={ A->C, B- >C, C->D, DE->C, CE->A} (ii) R (XYZWQ), FD= {X->Z, Y->Z, Z->W, WQ->Z, ZQ-> X, R1 (XW), R2 (XY), R3 (YQ) , R4 (ZWQ), R5 (XQ) b. Eliminate redundant FDs from (i) F={X->Y, Y->X, Y->Z, Z->Y, X->Z, Z->X} (ii) F = {X->YZ, ZW->P, P->Z, W->XPQ, XYQ, YW, WQ ->YZ}
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education