lc98 98. Validate Binary Search Tree

最新推荐文章于 2024-11-01 15:19:21 发布

laohixdxm00

最新推荐文章于 2024-11-01 15:19:21 发布

阅读量92

点赞数

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/laohixdxm00/article/details/120208363

版权

这篇博客探讨了如何验证一个二叉树是否符合二叉搜索树的性质。作者提出了两种思路：首先，确保左子树和右子树都是二叉搜索树，并且左子树的最大值小于根节点值，右子树的最小值大于根节点值。其次，通过自顶向下的递归方法，每次遍历时传递当前节点的左右边界值。博客中提供了详细的代码实现，包括处理节点值相等的情况以及边界值的计算方法。

摘要由CSDN通过智能技术生成

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);
    }

}