//C++ using BST .

// write a function recursively to return the average of the longest path in a tree.

starting with this function: int avgPath()

This is the header file(bst.h)

#include #include #include using namespace std;

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

class table { public: table(); ~table(); void build();

void display();

/* ************** PLACE YOUR PROTOTYPE HERE ***************** */ int avgPath();

private: node * root; };