LeetCode——98. Validate Binary Search Tree(C++)

最新推荐文章于 2024-08-10 22:52:22 发布

begforgood

最新推荐文章于 2024-08-10 22:52:22 发布

阅读量83

点赞数

分类专栏： Leetcode 文章标签： leetcode 深度优先算法 c++

本文链接：https://blog.csdn.net/begforgood/article/details/125275486

版权

Leetcode 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

该博客介绍了如何解决LeetCode上的第98题，即验证给定的二叉树是否为有效的二叉搜索树。通过深度优先搜索（DFS）策略，递归地检查每个节点的值是否满足二叉搜索树的条件：左子树所有节点值小于当前节点，右子树所有节点值大于当前节点。代码中定义了一个名为`dfs`的辅助函数，利用long型的极大值和极小值作为边界条件进行判断。对于给定的两个测试用例，分别返回了正确的判断结果。

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

LeetCode——98. Validate Binary Search Tree(C++)
Description:
Given the root of a binary tree, determine if it is a valid binary search tree (BST).

A valid 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.
在这里插入图片描述
Input: root = [2,1,3]
Output: true

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

The number of nodes in the tree is in the range [1, 104].
-231 <= Node.val <= 231 - 1

题目解析：
就是判断是否是二叉搜索树，此题的val不可相等。dfs判断，floor和celine限制最左和最右边界。
代码：

class Solution {
    bool dfs(long floor,long celine,TreeNode* cur)
    {
        if(cur->val>=celine||cur->val<=floor)return false;
        bool lb=true,rb=true;
        if(cur->left!=NULL)
        {
            if(cur->val<=cur->left->val)return false;
            else
                lb=dfs(floor,cur->val,cur->left);
        }
        if(cur->right!=NULL)
        {
            if(cur->val>=cur->right->val)return false;
            else
                rb=dfs(cur->val,celine,cur->right);
        }
        return lb&&rb;
    }
public:
    bool isValidBST(TreeNode* root) {
        return dfs(-999999999999999999,99999999999999999,root);
    }
};