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

Input: [2,1,3]
Output: true
Example 2:

5

/
1 4
/
3 6

Input: [5,1,4,null,null,3,6]
Output: false
Explanation: The root node’s value is 5 but its right child’s value is 4.
中文：给定一个二叉树，判断其是否是一个有效的二叉搜索树。
假设一个二叉搜索树具有如下特征：
节点的左子树只包含小于当前节点的数。
节点的右子树只包含大于当前节点的数。
所有左子树和右子树自身必须也是二叉搜索树。

---

解答：严格规定了左子树小于，右子树大于，只需中序遍历二叉树即可，返回的结果是按顺序排列，如果不是，则false。（和501题基本完全一样）
代码：
非递归

class Solution {
public:
    bool isValidBST(TreeNode* root) {
        vector<int> res;
        stack<TreeNode*> s;
        TreeNode *p=root,*pre=NULL;
        while(p||!s.empty()){
            while(p){
                s.push(p);
                p=p->left;
            }
            p=s.top();
            s.pop();
            if(pre&&pre->val>=p->val) return false;
            pre=p;
            p=p->right;
        }
        return true;
    }
};

递归

class Solution {
public:
    bool isValidBST(TreeNode* root) {
        if (!root) return true;
        vector<int> vals;
        inorder(root, vals);
        for (int i = 0; i < vals.size() - 1; i++) {
            if (vals[i] >= vals[i + 1]) return false;
        }
        return true;
    }
    void inorder(TreeNode* root, vector<int>& vals) {
        if (!root) return;
        inorder(root->left, vals);
        vals.push_back(root->val);
        inorder(root->right, vals);
    }
};