Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Write the definition of the function nodeCount that returns the number of nodes in the binary tree and Add this function to the class binary Tree Type and create a program to test this function. USE THIS FILE TO TEST YOUR PROGRAM #include //Line 1 #include "binarySearch Tree.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 bSearch TreeType 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.inorder Traversal(print); //Line 18 cout << endl << "Line 19: Tree Height: " << treeRoot.treeHeight() <

Write the definition of the function nodeCount that returns the number of nodes in the binary tree and Add this function to the class binary Tree Type and create a program to test this function. USE THIS FILE TO TEST YOUR PROGRAM #include //Line 1 #include "binarySearch Tree.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 bSearch TreeType 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.inorder Traversal(print); //Line 18 cout << endl << "Line 19: Tree Height: " << treeRoot.treeHeight() <

Database System Concepts
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
icon
Related questions
Question
Send me your own work not AI generated response or plagiarised response. If I see these things, I'll give multiple downvotes and will definitely report.
Write the definition of the function nodeCount that returns the number of nodes in the binary tree and Add this function to the class binary Tree Type and create a program to test this function. USE THIS FILE TO TEST YOUR PROGRAM #include <iostream> //Line 1 #include "binarySearch Tree.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 bSearch Tree Type<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.inorder Traversal(print); //Line 18 cout << endl<< "Line 19: Tree Height: " << treeRoot.treeHeight() << endl << endl; //Line 19 cout << "Line 20: ******* Update Nodes" <<"*******" << endl; //Line 20 treeRoot.inorder Traversal(update); //Line 21 cout << "Line 22: Tree nodes in inorder" << "after the update: "<<endl <<""; //Line 22 treeRoot.inorder Traversal(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
Transcribed Image Text:Write the definition of the function nodeCount that returns the number of nodes in the binary tree and Add this function to the class binary Tree Type and create a program to test this function. USE THIS FILE TO TEST YOUR PROGRAM #include <iostream> //Line 1 #include "binarySearch Tree.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 bSearch Tree Type<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.inorder Traversal(print); //Line 18 cout << endl<< "Line 19: Tree Height: " << treeRoot.treeHeight() << endl << endl; //Line 19 cout << "Line 20: ******* Update Nodes" <<"*******" << endl; //Line 20 treeRoot.inorder Traversal(update); //Line 21 cout << "Line 22: Tree nodes in inorder" << "after the update: "<<endl <<""; //Line 22 treeRoot.inorder Traversal(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

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 5 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of trees
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS