A binary tree is full if all of its vertices have either zero or two children. Let Bn denote the number of full binary trees wit
h n vertices.
(a) By drawing out all full binary trees with 3, 5, or 7 vertices, determine the exact values of B3, B5, and B7. Why have we left out even numbers of vertices, like B4?
(b) For general n, derive a recurrence relation for Bn.
(c) Show by induction that Bn is (2n). 2.14. You are given an array of n elements, and
(a) By drawing out all full binary trees with 3, 5, or 7 vertices, determine the exact values of B3, B5, and B7. Why have we left out even numbers of vertices, like B4?
(b) For general n, derive a recurrence relation for Bn.
(c) Show by induction that Bn is (2n). 2.14. You are given an array of n elements, and
1 answer:
You might be interested in
Answer:
see explaination
Explanation:
#include <iostream>
using namespace std;
void display (string* name, double* purchase, int n)
{
cout<<"Name Purchase"<<endl;
cout<<"------------------------"<<endl<<endl;
for(int i=0;i<n;i++)
{
cout<<name[i]<<" "<<purchase[i]<<endl;
}
}
double calculate(double* purchase,int n)
{
double avg, sum=0;
for(int i=0;i<n;i++)
{
sum=sum+purchase[i];
}
avg=sum/n;
return avg;
}
int main()
{
int n;
cout<<"How many customer will you enter? "<<endl;
cin>>n;
string *name=new string[n];
double *purchase=new double[n];
for(int i=0;i<n;i++)
{
cout<<"Enter the customer"<<i+1<<"'s name: "<<endl;
cin>>name[i];
cout<<"Enter that customer's purchase: "<<endl;
cin>>purchase[i];
}
display(name, purchase,n);
double avg=calculate(purchase,n);
cout<<"Average purchase: "<<avg<<endl;
}
See attachment for the screenshot
