validate-binary-search-tree

最新推荐文章于 2022-02-25 23:41:44 发布

想吃锅包肉哇

最新推荐文章于 2022-02-25 23:41:44 发布

阅读量102

点赞数

分类专栏： Leetcode 文章标签：树中序遍历

本文链接：https://blog.csdn.net/weixin_36909758/article/details/90695160

版权

Leetcode 专栏收录该内容

125 篇文章 0 订阅

订阅专栏

【题目描述】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.

【解题思路】将上题变动一下即可

【考查内容】树，中序遍历

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode *pre;
    int flag=1;
    bool isValidBST(TreeNode *root) {
         pre=NULL;
         dfs(root);
         if(flag)
             return true;
        return false;
    }
    void dfs(TreeNode *root){
         if(!root) return;
         dfs(root->left);
         if(pre&&pre->val>=root->val)
              flag=0;
         pre=root;
         dfs(root->right);
    }
};