98. 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 thanthe 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.

Example 1:

2
/ \
1 3

Binary tree [2,1,3], return true.
Example 2:

1
/ \
2 3

Binary tree [1,2,3], return false.
思路：这道题目要求判断给定的一棵二叉树是否是BST，中序遍历一棵BST会得到一个升序的序列，因次本题可采用中序遍历的方法，同时设置一个指针pre指向当前遍历节点的前驱节点。代码实现如下：

/**
 * 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 isValid(TreeNode* root, TreeNode* &pre) {
        if (!root) return true;
        if (!isValid(root->left, pre)) return false;
        //judge
        if (pre && pre->val >= root->val) return false;
        pre = root;
        return isValid(root->right, pre);
    }

    bool isValidBST(TreeNode* root) {
        TreeNode* pre = NULL;

        return isValid(root, pre);
    }
};