Complete the definition of method max() below so it returns the largest value stored in any node in the Binary Search tree. You should assume that the initial tree in the first call to max has at least one node, but you may not make any other assumptions about the number of nodes in the tree or the values stored in them. For full credit, your method must not visit any more nodes in the tree than are actually necessary

// return the largest value in the binary search tree with node* r pointing to the root node int max(node* r)