Write recursive and iterative functions to find the maximum value of a binary search tree. If the tree is empty, the function should return $.$

int BinarySearchTree::rmax$()$ const $\{$

return max$($root$)$;

$\}$

int BinarySearchTree::rmax$($Node $*$r$)$ const $\{$

$//$ returns the maximum value of the tree using recursion

$\}$

int BinarySearchTree::imax$()$ const $\{$

$//$ returns the maximum value of the tree using a loop

$\}(inc++)$