Given a non-empty binary search tree (an ordered binary tree), return the minimum data value found in that tree. Note that it is not necessary to search the entire tree. A maxValue() function is structurally very similar to this function. This can be solved with recursion or with a simple while loop. int minValue(struct node* node) {
/\*
Given a non-empty binary search tree,
return the minimum data value found in that tree.
Note that the entire tree does not need to be searched.
\*/
int minValue(struct node\* node) {
struct node\* current = node; // loop down to find the leftmost leaf
while (current->left != NULL) {
current = current->left;
}
return(current->data);
}