[leetcode] 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 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，题目难度为Medium。

如果二叉树是BST，中序遍历此二叉树得到的节点数据是递增的，这就把问题转化为了中序遍历二叉树，只需记录下前一节点的数值进行比对即可。大家可以先看一下第94题（传送门）中序遍历二叉树。

递归版本代码：

class Solution {
    bool chkValidBST(TreeNode* n, long long& preVal) {
        if(!n) return true;
        if(!chkValidBST(n->left, preVal)) return false;
        if(n->val <= preVal) return false;
        else preVal = n->val;
        if(!chkValidBST(n->right, preVal)) return false;
        return true;
    }
public:
    bool isValidBST(TreeNode* root) {
        long long preVal = LONG_MIN;
        return chkValidBST(root, preVal);
    }
};

非递归版本代码：

class Solution {
public:
    bool isValidBST(TreeNode* root) {
        stack<TreeNode*> stk;
        TreeNode* p = root;
        long long preVal = LONG_MIN;
        
        while(!stk.empty() || p) {
            while(p) {
                stk.push(p);
                p = p->left;
            }
            p = stk.top();
            stk.pop();
            if(p->val <= preVal) return false;
            preVal = p->val;
            p = p->right;
        }
        return true;
    }
};