Validate Binary Search Tree

最新推荐文章于 2021-01-26 17:17:22 发布

撄宁之境

最新推荐文章于 2021-01-26 17:17:22 发布

阅读量477

点赞数

分类专栏： LeetCode 文章标签： LeetCode 遍历

本文链接：https://blog.csdn.net/huangynn/article/details/38908457

版权

LeetCode 专栏收录该内容

67 篇文章 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.

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

中序遍历后得到的结果应该是递增序列，否则不是bst

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<int>num;
    void travel(TreeNode * root){
        if(!root) return;
        travel(root->left);
        num.push_back(root->val);
        travel(root->right);
    }
    bool isValidBST(TreeNode *root) {
        if(!root) return true;
        travel(root);
        for(int i=0;i<num.size()-1;i++){
            if(num[i]>=num[i+1]) return false;
        }
        return true;
    }
};