JAVA

The following code has an empty method to compute the maximum of all elements in a binary search tree. Fill in the method body to iteratively or recursively compute the maximum value in the binary search tree. Return Integer.MIN_VALUE if the tree is empty.

class TreeNode {

TreeNode left;

TreeNode right;

int value;

}

public int getMax(TreeNode root) {

//fill in code here

}