In C++, please follow the instructions and also give a sample output of your program. Exercise L4-1 Chapter 19 - Binary TreesWrite a program to do the following:a. First define and implement a templated binary tree class, name it "binaryTreeType". Usethe "binaryTreeType" example from the book for your starting point and modify it as needed.Store it as "binaryTreeType.h".b. Next define and implement a templated binary search tree class name it"binarySearch TreeType", and derive it from the "binary TreeType" class you created instep a. Store it as "binarySearchTreeType.h".c.Have your program create three instances of your " binarySearch TreeType" named T1, T2,T3.d. Do a postorder traversal of T1 and, while doing the postorder traversal, insert each nodeinto T2.e. Do a preorder traversal of T2 and, while doing the preorder traversal, insert each node intoT3.Do an inorder traversal of T3.f.g. Call the swapSub Trees() function in 73, then do an inorder traversal of T3.h. Output the heights and the number of leaves in each of the three binarySearch TreeTypeinstances.Submit only the header files (binaryTreeType.h, and binarySearch TreeType.h) and yourdocumentation files. The header files must include all function definitions. Validate compilationof your header files with the following code. The test program will exercise all functions in theclasses listed above.//Data: 65 55 22 44 61 19 90 10 78 52-999#include #include "binary Search TreeType.h"using namespace std;int main(){binary Search TreeType treeRoot,int num;cout << "Enter integers ending with -999" << endl;cin >> num;while (num != -999) }{}cout << endl<< "Tree nodes in inorder: ";treeRoot.inorderTraversal();cout << endl<<< "Tree nodes in preorder: "";treeRoot.preorderTraversal();cout << endl<< "Tree nodes in postorder: ";treeRoot.postorderTraversal();treeRoot.insert(num);cin >> num;cout << endl;cout << "Tree Height: "<< treeRoot.treeHeight() << endl;treeRoot.swapSubtrees();return 0;Your program output must look like the example below.G:\Coursework/CIS 23-Data Structures and Algorithms 2020 Fall ONLINE Solutions Lab4L4-1>L4-1Soln.exeEnter numbers ending with -99916 08 24 04 12 20 28 02 06 10 14 18 22 26 30 01 03 05 07 09 11 13 15 17 19 21 23 25 27 29 31 -999tree1 nodes In Inorder: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31tree1 nodes in postorder: 13257649 11 10 13 15 14 12 8 17 19 18 21 23 22 20 25 27 28 29 31 30 28 24 16tree2 nodes in preorder: 132547 69 8 11 10 13 12 15 14 17 16 18 18 21 20 23 22 25 24 27 26 29 28 31 30tree3 nodes In Inorder: 123456789 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31tree1 height: 5tree1 leaves: 16tree2 height: 16tree2 leaves: 15tree3 height: 16tree3 leaves: 15swapSubtree for tree3tree3 nodes In Inorder: 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7654321

Program: #include <iostream>#include <cmath> using namespace std; struct Node{ int…

Exercise L4-1 Chapter 19 - Binary Trees Write a program to do the following: a. First define and implement a templated binary tree class, name it "binaryTreeType". Use the "binaryTreeType" example from the book for your starting point and modify it as needed. Store it as "binaryTreeType.h". b. Next define and implement a templated binary search tree class name it "binarySearch TreeType", and derive it from the "binary TreeType" class you created in step a. Store it as "binarySearchTreeType.h". c. Have your program create three instances of your " binarySearch TreeType" named T1, T2, T3. d. Do a postorder traversal of T1 and, while doing the postorder traversal, insert each node into 72. e. Do a preorder traversal of 72 and, while doing the preorder traversal, insert each node into 13. f. Do an inorder traversal of 73. g. Call the swapSub Trees() function in T3, then do an inorder traversal of T3. h. Output the heights and the number of leaves in each of the three binarySearch TreeType instances.

Exercise L4-1 Chapter 19 - Binary Trees Write a program to do the following: a. First define and implement a templated binary tree class, name it "binaryTreeType". Use the "binaryTreeType" example from the book for your starting point and modify it as needed. Store it as "binaryTreeType.h". b. Next define and implement a templated binary search tree class name it "binarySearch TreeType", and derive it from the "binary TreeType" class you created in step a. Store it as "binarySearchTreeType.h". c. Have your program create three instances of your " binarySearch TreeType" named T1, T2, T3. d. Do a postorder traversal of T1 and, while doing the postorder traversal, insert each node into 72. e. Do a preorder traversal of 72 and, while doing the preorder traversal, insert each node into 13. f. Do an inorder traversal of 73. g. Call the swapSub Trees() function in T3, then do an inorder traversal of T3. h. Output the heights and the number of leaves in each of the three binarySearch TreeType instances.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: I am unable to read a complete single line sentence as input in C++. Using cin it's reading first…

A: To read a complete sentence in c++ use getline() function. The syntax is: getline(cin,stringName);…

Q: How do you write a test plan that you can run to test each code path in your original program for…

A: The test plan can be designed by considering the following points: The original C++ program…

Q: Write a C function that uses a for loop to multiply all the numbers from 1 through and including N.…

A: A function's logic and flow must be understood in C programming in order to write code effectively.…

Q: take the input from the user(infix,postfix and prefix). and then display all three…

A: C++ program to convert infix to prefix and postfix: #include <bits/stdc++.h>using namespace…

Q: Write a program in Python, C++, or C that gets an integer from the user, prints out that value, then…

A: To gets an integer from the user : value=int(input("Enter the integer value: ")) To prints out that…

Q: I need help adding input validation to a C++ code that has multiple inputs

A: C++ program to validate the user input is given below.

Q: C++ please, thanks. A prime number is an integer n > 1 whose only positive divisors are 1 and n…

A: Prime Number: A number is called a prime number if only if the number has two divisors. They are 1…

Q: the same time you can break this function into 20 smaller functions calling each other. Which…

A: C++ is a powerful programming language that allows developers to write code in various ways. One…

Q: write a c++ program

A: According to the question We have to write C++ Code for Given a time in 24-hour notation, write a…

Q: This is very helpful thank you. If possible can you please show me how to make the function with the…

A: In this question we have to write two functions for C++ program with bubble sort and merge sort…

Q: 4. Create a function in the C language that takes an integer as the parameter and returns the count…

A: Create a function in the C language that takes an integer as the parameter and returns the count of…

Concept explainers

Binomial Heap

A binomial heap is a group of binomial trees. This data structure acts as a priority queue and implements the merge operation faster.

Question

In C++, please follow the instructions and also give a sample output of your program.

Exercise L4-1 Chapter 19 - Binary Trees
Write a program to do the following:
a. First define and implement a templated binary tree class, name it "binaryTreeType". Use
the "binaryTreeType" example from the book for your starting point and modify it as needed.
Store it as "binaryTreeType.h".
b. Next define and implement a templated binary search tree class name it
"binarySearch TreeType", and derive it from the "binary TreeType" class you created in
step a. Store it as "binarySearchTreeType.h".
c.
Have your program create three instances of your " binarySearch TreeType" named T1, T2,
T3.
d. Do a postorder traversal of T1 and, while doing the postorder traversal, insert each node
into T2.
e. Do a preorder traversal of T2 and, while doing the preorder traversal, insert each node into
T3.
Do an inorder traversal of T3.
f.
g. Call the swapSub Trees() function in 73, then do an inorder traversal of T3.
h. Output the heights and the number of leaves in each of the three binarySearch TreeType
instances.
Submit only the header files (binaryTreeType.h, and binarySearch TreeType.h) and your
documentation files. The header files must include all function definitions. Validate compilation
of your header files with the following code. The test program will exercise all functions in the
classes listed above.
//Data: 65 55 22 44 61 19 90 10 78 52-999
#include <iostream>
#include "binary Search TreeType.h"
using namespace std;
int main()
{
binary Search TreeType<int> treeRoot,
int num;
cout << "Enter integers ending with -999" << endl;
cin >> num;
while (num != -999)

}
{
}
cout << endl<< "Tree nodes in inorder: ";
treeRoot.inorderTraversal();
cout << endl<<< "Tree nodes in preorder: "";
treeRoot.preorderTraversal();
cout << endl<< "Tree nodes in postorder: ";
treeRoot.postorderTraversal();
treeRoot.insert(num);
cin >> num;
cout << endl;
cout << "Tree Height: "<< treeRoot.treeHeight() << endl;
treeRoot.swapSubtrees();
return 0;
Your program output must look like the example below.
G:\Coursework/CIS 23-Data Structures and Algorithms 2020 Fall ONLINE Solutions Lab4L4-1>L4-1Soln.exe
Enter numbers ending with -999
16 08 24 04 12 20 28 02 06 10 14 18 22 26 30 01 03 05 07 09 11 13 15 17 19 21 23 25 27 29 31 -999
tree1 nodes In Inorder: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
tree1 nodes in postorder: 13257649 11 10 13 15 14 12 8 17 19 18 21 23 22 20 25 27 28 29 31 30 28 24 16
tree2 nodes in preorder: 132547 69 8 11 10 13 12 15 14 17 16 18 18 21 20 23 22 25 24 27 26 29 28 31 30
tree3 nodes In Inorder: 123456789 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
tree1 height: 5
tree1 leaves: 16
tree2 height: 16
tree2 leaves: 15
tree3 height: 16
tree3 leaves: 15
swapSubtree for tree3
tree3 nodes In Inorder: 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7654321

Process by which instructions are given to a computer, software program, or application using code.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Step 1

VIEW

Step 2: Step 2

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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

Write a C++ program that will print out the following simple shapes: triangle, rectangle and diamond using different characters for each shape. Requirements:- each shape uses a different character and it must be exactly 5 lines.- for this exercise, please do not use loop but only simple printing characters.
Please solve this in C programming language as early as possible. .Write a recursive function that can use to add all the numbers from 5 to n, where n>5. n will be given by the user. Prototype: int add_num(int n);
Write C language function to get two numbers as a parameter and return sum of those two numbers. Thanks in advance
Please us c++ to make the code thank you very much!
Create a function in C++ using recursion where the user inputs a number. The function will repeat an equation where you get the square root of a number for the amount of loops selected. A random number between 1-10 will be used to determine the length of the loop.