LeetCode刷题6--验证二叉搜索树

验证二叉搜索树

链接

题目描述

给定一个二叉树，判断其是否是一个有效的二叉搜索树。

假设一个二叉搜索树具有如下特征：

节点的左子树只包含小于当前节点的数。
节点的右子树只包含大于当前节点的数。
所有左子树和右子树自身必须也是二叉搜索树。

代码

python

class Solution(object):
    def isValidBST(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        def helper(root,lower = float('-inf'), upper = float('inf')):
            if root==None:
                return True
            if root.val<=lower or root.val>=upper:
                return False
            return helper(root.left,lower,root.val) and helper(root.right,root.val,upper)
        return helper(root)

c++

/**
 * 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 helper(TreeNode* root,long upper,long lower){
        if (root==NULL) return true;
        if (root->val<=lower || root->val>=upper) return false;
        return helper(root->left,root->val,lower) && helper(root->right,upper,root->val);
    }
    bool isValidBST(TreeNode* root) {
        
        return helper(root,LONG_MAX,LONG_MIN);

    }
};

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

    }

}