[leetcode-98]Validate Binary Search Tree（c++)

问题描述：
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.
confused what “{1,#,2,3}” means? > read more on how binary tree is serialized on OJ.

分析：这道题很明显是要使用递归的思想，但是要注意在递归的过程中，需要维护一个最大值和最小值。即查看子树时，左子树一定小于当前值，右子树一定大于当前值。而且是递归的大于。

这里还有一个要注意点：如果使用INT_MAX和INT_MIN，那么会产生一些问题，应该将其转换为LONG_MIN或者其他更高精度数据类型。

代码如下：16ms

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool checkBST(TreeNode* root, long leftVal, long rightVal) {
        if (!root)
            return true;
        int curVal = root->val;
        if (curVal<=leftVal || curVal>=rightVal)
            return false;
        return checkBST(root->left, leftVal, curVal) && checkBST(root->right, curVal, rightVal);
    }
    bool isValidBST(TreeNode* root) {
        return checkBST(root,LONG_MIN,LONG_MAX);
    }
};