leetcode-Validate Binary Search Tree

题目描述：

Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

• The left subtree of a node contains only nodes with keys less than the node's key.
• The right subtree of a node contains only nodes with keys greater than the node's key.
• Both the left and right subtrees must also be binary search trees.

要求是一个二叉树的某个节点的左子树的所有节点的值必须小于该节点的值，右子树的所有节点的值必须大于该节点的值

其实这样的二叉树的中序遍历的结果是一个升序排列的组合

上代码

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