Write the definition of the function nodeCount that returns the number of nodes in the binary tree and Add this function to the class binaryTreeType and create a program to test this function. USE THIS FILE FOR YOUR PROGRAM USE THIS FILE TO TEST YOUR PROGRAM #include //Line 1 #include "binarySearchTree.h" //Line 2 using namespace std; //Line 3 void print(int& x); //Line 4 void update(int& x); //Line 5 int main() //Line 6 { //Line 7 bSearchTreeType treeRoot; //Line 8 int num; //Line 9 cout << "Line 10: Enter numbers ending " << "with -999." << endl; //Line 10 cin >> num; //Line 11 while (num != -999) //Line 12 { //Line 13 treeRoot.insert(num); //Line 14 cin >> num; //Line 15 } //Line 16 cout << endl << "Line 17: Tree nodes in inorder: "; //Line 17 treeRoot.inorderTraversal(print); //Line 18 cout << endl << "Line 19: Tree Height: " << treeRoot.treeHeight() << endl << endl; //Line 19 cout << "Line 20: * Update Nodes " << "" << endl; //Line 20 treeRoot.inorderTraversal(update); //Line 21 cout << "Line 22: Tree nodes in inorder " << "after the update: " << endl << " "; //Line 22 treeRoot.inorderTraversal(print); //Line 23 cout << endl << "Line 24: Tree Height: " << treeRoot.treeHeight() << endl; //Line 24 return 0; //Line 25 } //Line 26 void print(int& x) //Line 27 { //Line 28 cout << x << " "; //Line 29 } //Line 30 void update(int& x) //Line 31 { //Line 32 x = 2 x; //Line 33 } //Line 34

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

Question

Write the definition of the function nodeCount that returns the number of nodes in the binary tree and Add this function to the class binaryTreeType and create a program to test this function.

USE THIS FILE FOR YOUR PROGRAM

USE THIS FILE TO TEST YOUR PROGRAM

#include <iostream> //Line 1
#include "binarySearchTree.h" //Line 2
using namespace std; //Line 3

void print(int& x); //Line 4
void update(int& x); //Line 5
int main() //Line 6
{ //Line 7
bSearchTreeType<int> treeRoot; //Line 8
int num; //Line 9
cout << "Line 10: Enter numbers ending "
<< "with -999." << endl; //Line 10
cin >> num; //Line 11
while (num != -999) //Line 12
{ //Line 13
treeRoot.insert(num); //Line 14
cin >> num; //Line 15
} //Line 16
cout << endl
<< "Line 17: Tree nodes in inorder: "; //Line 17
treeRoot.inorderTraversal(print); //Line 18
cout << endl << "Line 19: Tree Height: "
<< treeRoot.treeHeight()
<< endl << endl; //Line 19
cout << "Line 20: ******* Update Nodes "
<< "*******" << endl; //Line 20
treeRoot.inorderTraversal(update); //Line 21
cout << "Line 22: Tree nodes in inorder "
<< "after the update: " << endl
<< " "; //Line 22
treeRoot.inorderTraversal(print); //Line 23
cout << endl << "Line 24: Tree Height: "
<< treeRoot.treeHeight() << endl; //Line 24
return 0; //Line 25
} //Line 26
void print(int& x) //Line 27
{ //Line 28
cout << x << " "; //Line 29
} //Line 30
void update(int& x) //Line 31
{ //Line 32
x = 2 * x; //Line 33
} //Line 34

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

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