带有bool返回值的递归

最新推荐文章于 2024-08-09 17:30:54 发布

unshaven111

最新推荐文章于 2024-08-09 17:30:54 发布

阅读量1.8k

点赞数

分类专栏： C 文章标签：带有bool返回值的递归

本文链接：https://blog.csdn.net/qq_38251888/article/details/85078539

版权

C 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Validate Binary Search Tree
Medium

1428

223

Favorite

Share
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.

bool isValidBST(TreeNode* root) {
    return isValidBST(root, NULL, NULL);
}

bool isValidBST(TreeNode* root, TreeNode* minNode, TreeNode* maxNode) {
    if(!root) return true;
    if(minNode && root->val <= minNode->val || maxNode && root->val >= maxNode->val)
        return false;
    return isValidBST(root->left, minNode, root) && isValidBST(root->right, root, maxNode);
}