98. Validate Binary Search Tree

Description:

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.

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

代码：

/**
 * 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 {
private:
    int prevVal;
    bool isInit, flag;
public:
    void inOrder(TreeNode* root) {
        std::cout << prevVal << std::endl;
        if (root != NULL) {
            inOrder(root->left);
            if (isInit) {
                prevVal = root->val;
                isInit = false;
            } else if (prevVal >= root->val) {
                flag = false;
                return;
            } else {
                prevVal = root->val;
            }
            inOrder(root->right);
        }
    }

    bool isValidBST(TreeNode* root) {
        isInit = true;
        flag = true;
        inOrder(root);
        return flag;
    }
};