In C++, you will need to write the following three functions intable.cpp, and add function prototypes for them to table.h. Filesupplied.o contains code that can build, display, duplicate, anddestroy a binary search tree
int count(node * root) Recursively compute and return the numberof nodes in the bst.
int sum(node * root) Recursively compute and return the sum ofthe ints contained in the bst.
int height(node * root) Recursively compute and return theheight of the bst
———————–
Given:
———
table.h
//list.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
/* ************** PLACE YOUR
PayPal Gateway not configured
PayPal Gateway not configured