[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:
    int tmp;
    bool tag;
    bool key;
    bool isValidBST(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        tag = false;
        key = true;
        check(root);
        return key;
    }
    void check(TreeNode *root)
    {
        if(key == false)
            return;
        if(root == NULL)
            return;
        check(root->left);
        if(tag == false)
        {
            tmp = root->val;
            tag = true;
        }
        else
        {
            if(root->val <= tmp)
                key = false;
            else
                tmp = root->val;
        }
        check(root->right);
    }
};