Validate Binary Search Tree

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    /*利用二叉搜索树的特点，中序遍历然后判断是否严格升序。
    bool isValidBST(TreeNode *root) 
    {
        vector<int> ret;
        InOrder(root,ret);
        if(ret.size()<=1)
            return true;
        for(auto i=ret.begin()+1;i!=ret.end();++i)
        {
            if(*i<=*(i-1))
                return false;
        }
        return true;
    }
    
    void InOrder(TreeNode *root,vector<int> &ret)
    {
        
        if(root==NULL)
            return;
        InOrder(root->left,ret);
        
        ret.push_back(root->val);
        
        InOrder(root->right,ret);
        
    }
    */
    
 
    TreeNode* last = NULL;
    bool isValidBST(TreeNode *root) 
    {
        if(root == NULL)
            return true;
        else
        {
            bool leftRes = isValidBST(root->left);
            if(leftRes == false)
                return false;
            if(last && last->val >= root->val)
                return false;
            last = root;
            return isValidBST(root->right);
        }
    }
        
};