Answer:
The new root will be 2.
<em></em>
Explanation:
The binary tree is not properly presented (See attachment)
To answer this; first, we need to order the nodes of the tree in a pre-order traversal.
We use pre-order because the question says if something is removed from the left child.
So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.
The root of the binary tree is 14 and if 14 is removed, the next is 2.
<em>Hence, the new root will be 2.</em>
The program is an illustration of arrays.
Arrays are used to hold multiple values in one variable.
The program in C++ where comments are used to explain each line is as follows:
#include <iostream>
using namespace std;
int main(){
//This declares an array of three elements for the three ratings
int ratings[3];
//This initializes the sum of the ratings to 0
int total = 0;
//The following iteration gets input for the three ratings
for(int i = 0; i<3;i++){
cin>>ratings[i];
//This calculates the sum of all inputs
total+=ratings[i];
}
//This declares and initializes the lowest and the highest ratings
int lowest = ratings[0], highest = ratings[0];
//This iterates through the array
for(int i = 1; i<3;i++){
//The following if condition determines the lowest rating
if (lowest > ratings[i]){ lowest = ratings[i]; }
//The following if condition determines the highest rating
if (highest < ratings[i]){ highest = ratings[i]; }
}
//This prints the output header
cout<<"The ratings are: ";
//The following iteration prints the three ratings
for(int i = 0; i<3;i++){
cout<<ratings[i]<<" "; }
//The prints the highest ratings
cout<<endl<<"Highest: "<<highest<<endl;
//The prints the lowest rating
cout<<"Lowest: "<<lowest<<endl;
//The prints the average rating
cout<<"Average: "<<total/3<<endl;
return 0;
}
At the end of the program, the ratings entered, the highest rating, the lowest rating, and the average of the ratings are printed.
See attachment for sample run
Read more about similar programs at:
