In C++, you will need to write the following three functions in table.cpp, and add function prototypes for them to table.h. File supplied.o contains code that can build, display, duplicate, and destroy a binary search tree

int count(node * root) Recursively compute and return the number of nodes in the bst.

int sum(node * root) Recursively compute and return the sum of the ints contained in the bst.

int height(node * root) Recursively compute and return the height of the bst

-----------------------

Given:

---------

table.h

//list.h #include #include #include 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 PROTOTYPE HERE ***************** */

----------------

main.cpp

#include "table.h"

#include

using namespace std;

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

/* PLACE YOUR FUNCTION CALL HERE */

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