LeetCode98 验证二叉搜索树

最新推荐文章于 2025-07-23 08:36:55 发布

原创最新推荐文章于 2025-07-23 08:36:55 发布 · 178 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

本文探讨了如何判断一个二叉树是否为有效的二叉搜索树。通过递归算法，确保每个节点的左子树所有节点小于该节点，右子树所有节点大于该节点，且左右子树本身也必须是二叉搜索树。

Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.
Example 1:

Input:
2
/
1 3
Output: true
Example 2:

/
1 4
/
3 6
Output: false
Explanation: The input is: [5,1,4,null,null,3,6]. The root node’s value
is 5 but its right child’s value is 4.

class Solution {
    public boolean isValidBST(TreeNode root) {
        return helper(root, null, null);
    }
    private boolean helper(TreeNode root, Integer min, Integer max){
        if(root == null) return true;
        if(min != null && root.val <= min) return false;
        if(max != null && root.val >= max) return false;

        return helper(root.left, min, root.val) && helper(root.right, root.val, max);
    }
}