Question

For this lab, you will need to write the following functions in table.cpp,
and add function prototypes for them to table.h and invoke the functions in
main.cpp.

* int countNodes(node * root)

Recursively count the number of the nodes in the tree.

* int sumLeaves(node * root)

Recursively sum all of the leaf nodes in the tree.

You must use the functions with these exact function prototypes.
******************************************************************************

main.cpp

#include "table.h"

#include <iostream>

using namespace std;

int main()
{
node * root = NULL;
build(root);
display(root);

int count = countNodes(root);
cout << "Count nodes: " << count << endl;

int sum = sumLeaves(root);
cout << "Sum leaves: " << sum << endl;

display(root);
destroy(root);
return 0;
}

**********************************

table.cpp

#include "table.h"

//Please put the impelementation of the required functions here

*************************************************

table.h

#ifndef TABLE_H
#define TABLE_H
//table.h
#include <iostream>
#include <cstring>
#include <cctype>
using namespace std;

struct node
{
int data;
node * left;
node * right;;
};

void build(node * & root); //supplied
void display(node * root); //supplied
void destroy(node * & root); //supplied

int countNodes(node* root);
int sumLeaves(node* root);

#endif

Answer 1

//table.cpp

#include "table.h"

int countNodes(node* root){
   if(root == NULL) return 0;
   return 1 + countNodes(root->left) + countNodes(root->right);
}
int sumLeaves(node* root){
   if (root == NULL) return 0;
  
   if (root->left == NULL && root->right == NULL)
            return root->data;
    else
        return sumLeaves(root->left) + sumLeaves(root->right);
}