[4 points] Write a short RECURSIVE method that finds the maximum value in binary search tree. This method needs to be recursive. Your method should not be more than five lines of code. ---Tree Node object contains int val, TreeNode * left , TreeNode* right
Initially invoked as findMaxRecursive(root); root will not be null

int AVLTree::findMaxRecursive (TreeNode* curNode) {
// your codee here!
}