Tournament Tree Second Value

public static Integer recurse(BTreeNode root) {
if(root.left == null || root.right == null)
return Integer.MAX_VALUE;
int res;
if(root.left.val == root.val)
res = Math.min(root.right.val, recurse(root.left));
else
res = Math.min(root.left.val, recurse(root.right));

return res;
}