Given a Binary Search Tree, return the node with the maximum data.

Example: 4 / \ 2 8 / \ 5 10 Output ==> 10

Need a **hand?** Try out these hints, one at a time.

Return the right most node of the tree.

1. If the `root`

node is null, return `null`

.

2. If the right node of `root`

is `null`

, return `root`

.

3. Else recurse through right nodes. i.e. `return findMax(root.right)`

public TreeNode findMax(TreeNode root) { }

**C**

**Java**

**Python**