Validate Binary Search Tree

1.中序遍历二叉查找树

2.检测序列是否单调递增

 

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    void Inorder(TreeNode *root,vector<int> &vec){
        if(root==NULL)return ;
        Inorder(root->left,vec);
        vec.push_back(root->val);
        Inorder(root->right,vec);
    }
public:
    bool isValidBST(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int> vec;
        Inorder(root,vec);
        for(int i=1;i<vec.size();++i){
            if(vec[i-1]>=vec[i])return false;
        }
        return true;
        
    }
};