判断二叉搜索树的合法性

二叉搜索树的特点：中序遍历时输出的顺序总是从小到大

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