This is Binary Search Tree (Data structure) in C++. Write the following functions for a BST containing integer values 1.

[answerhappygod]

This is Binary Search Tree (Data structure) in C++.
Write the following functions for a BST containing integer
values
1.
double Average() //Calculates the average of the values ​​of a
BST. If the BST is empty, the method returns 0.
(hint: also implement the function “int averageRecursive(BSTNode
node, int &count)” // the count variable is used to count the
number of nodes visited.)
2.
int minimum() //returns the minimum value in a BST. If the BST
is empty, it returns 0.