面试题 04.05. 合法二叉搜索树

实现一个函数，检查一棵二叉树是否为二叉搜索树。

示例 1:

输入:
    2
   / \
  1   3
输出: true

示例 2:

输入:
    5
   / \
  1   4
     / \
    3   6
输出: false
解释: 输入为: [5,1,4,null,null,3,6]。
     根节点的值为 5 ，但是其右子节点值为 4 。

/**
 * 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 helper(TreeNode* root, long long lower, long long upper) {
        if (root == NULL) {
            return true;
        }
        if (root -> val <= lower || root -> val >= upper) {
            return false;
        }
        return helper(root -> left, lower, root -> val) && helper(root -> right, root -> val, upper);
    }
    bool isValidBST(TreeNode* root) {
        return helper(root, LONG_MIN, LONG_MAX);
    }
};

/**
 * 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 isValidBST(TreeNode* root) {
        TreeNode *pre = nullptr;
        return isValidBST(root, pre);
    }

private:
    bool isValidBST(TreeNode *root, TreeNode *&pre) {
        if (!root) return true;
        if (!isValidBST(root->left, pre)) return false;
        if (pre && pre->val >= root->val) return false;
        return isValidBST(root->right, pre = root);
    }
};

/**
 * 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 isValidBST(TreeNode* root) {
        if(root==NULL)return true;

        TreeNode*pre=NULL;
        stack<TreeNode*>s;

        while(root||s.size()){
            while(root){
                s.push(root);
                root=root->left;
            }
            root=s.top();
            s.pop();
            if(pre&&pre->val>=root->val)return false;
            pre=root;
            root=root->right;
        }
        return true;
    }
};

class Solution {
public:
    bool isValidBST(TreeNode* root) {
        return dfs(root,NULL,NULL);
    }

    bool dfs(TreeNode*root,TreeNode*min,TreeNode*max){
        if(root==NULL)return true;
        if(min&&root->val<=min->val)return false;
        if(max&&root->val>=max->val)return false;

        return dfs(root->left,min,root)&&dfs(root->right,root,max);
    }
};