lc98 98. Validate Binary Search Tree

https://leetcode-cn.com/problems/validate-binary-search-tree/submissions/

[brainstorm]
1 first idea is make sure left sub and right sub is BST.
then make sure biggest value in left sub is smaller than root value.
and least value in right sub is bigger than root value.
2 second idea is recursion go down from top to button.
each call, we have node value, and info from top to current node.
so left bound and right bound can be passed in.

[implement]
1 handle node has same value
2 since at root node bound does NOT exist.
use Integer.null for that.
extract left bound, right bound as method.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isValidBST(TreeNode root) {

        return dfs(root, null, null);
    }

    boolean dfs(TreeNode root, Integer l, Integer r){

        if(root==null){
            return true;
        }
        
        if(root.val<=l  || root.val>=r){
            return false;
        }

        boolean ret1 = dfs(root.left, l, rBound(root.val, r));
        boolean ret2 = dfs(root.right, Math.max(root.val, l), r);

        return ret1 && ret2;
    }

    Integer rBound(int val, Integer r){
        
        if(r==null){
            return val;
        }
        return Math.min(val, r);
    }

    Integer lBound(int val, Integer l){
        
        if(l==null){
            return val;
        }
        return Math.max(val, l);
    }

}