LeetCode98. Validate Binary Search Tree（C++）

最新推荐文章于 2021-07-05 14:20:18 发布

Brielleqqqqqqjie

最新推荐文章于 2021-07-05 14:20:18 发布

阅读量208

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/qq_41562704/article/details/86708314

版权

Leetcode 专栏收录该内容

110 篇文章 2 订阅

订阅专栏

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:

    5
   / \
  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.

解题思路：判断是否为BST，只要判断该树的中序遍历是否为递增

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int inorder ,cnt= 0;
    bool isValidBST(TreeNode* root) {
        if(root == NULL)
            return true;
        bool flag = isValidBST(root->left);
        if(cnt == 0)
            cnt++;
        else if(root->val <= inorder)
            return false;
        inorder = root->val;
        bool flag2 = isValidBST(root->right);
        return flag&&flag2;
    }
};