【LeetCode】LeetCode 98.验证二叉搜索树

LeetCode 98.验证二叉搜索树

题目链接：https://leetcode.cn/problems/validate-binary-search-tree/

题目

解答

迭代法

采用中序遍历遍历二叉树，如果为二叉搜索树，那么遍历的数组应该是有序的

class Solution {
private:
    vector<int> vec;
    void traversal(TreeNode* root){
        if(root == NULL)    return ;
        traversal(root->left);
        vec.push_back(root->val);
        traversal(root->right);
    }
public:
    bool isValidBST(TreeNode* root) {
        traversal(root);
        for(int i = 1; i < vec.size(); i++){
            if(vec[i] <= vec[i - 1]){
                return false;
            }
        }
        return true;
    }
};

也可以在遍历的过程中直接判断序列是否有序

class Solution {
public:
    TreeNode* pre = NULL;
    bool isValidBST(TreeNode* root) {
        if(root == NULL)    return true;
        bool left = isValidBST(root->left);

        if(pre != NULL && pre->val >= root->val)    return false;
        pre = root;
        
        bool right = isValidBST(root->right);

        return left && right;
    }
};

迭代法

对中序遍历代码稍加改动即可

class Solution {
public:
    bool isValidBST(TreeNode* root) {
        stack<TreeNode*> st;
        TreeNode* cur = root;
        TreeNode* pre = NULL;
        while(cur != NULL || !st.empty()){
            if(cur != NULL){
                st.push(cur);
                cur = cur->left;
            } else{
                cur = st.top();
                st.pop();
                if(pre != NULL && pre->val >= cur->val) return false;
                pre = cur;

                cur = cur->right;
            }
        }
        return true;
    }
};