leetcode98. 验证二叉搜索树

一:题目

二:上码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:

    /**
    思路验证是否是二叉搜索树  看看中序输出的序列是否为升序即可
    **/
    void orser(TreeNode* root,vector<int>& v) {
        if(root == nullptr) return ;
        
        if(root->left)  orser(root->left,v);
        v.push_back(root->val);
        if(root->right) orser(root->right,v);
    }

    bool isValidBST(TreeNode* root) {
        vector<int> ans;
        orser(root,ans);
        
        int flag = 1;
        for(int i = 0; i < ans.size()-1; i++) {
            if(ans[i+1] <= ans[i]) {
                flag = 0;
                break;
            }
        }

        if(flag == 0) return false;
        return true;

    }
};

感觉被困在一座孤岛上。。。。。。。。