(nice!!!)(LeetCode 热题 100)98. 验证二叉搜索树(深度优先搜索dfs)

题目：98. 验证二叉搜索树

思路：二叉搜索树里的每一个节点值，都要在某个区间范围内[l,r]。
因为存在int的最大值和最小值，所以l,r的初始值要比int范围大

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool dfs(TreeNode * root,long long l,long long r){
        if(root==nullptr) return true;
        if(root->val<=l || root->val>=r) return false;
        return dfs(root->left,l,root->val) && dfs(root->right,root->val,r);
    }
    bool isValidBST(TreeNode* root) {
        return dfs(root,LONG_MIN,LONG_MAX);
    }
};

JAVA版本：

/**
 * 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 {
    boolean dfs(TreeNode root,long l,long r){
        if(root==null) return true;
        if(root.val<=l || root.val>=r) return false;
        return dfs(root.left,l,root.val) && dfs(root.right,root.val,r);
    }
    public boolean isValidBST(TreeNode root) {
        return dfs(root,Long.MIN_VALUE,Long.MAX_VALUE);
    }
}