55. Jump Game

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

递归法：

/**
 * 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) {
        return helper(root, NULL, NULL);
    }
    // 对于根为root的子树：要判断它的左右子树结点是否在正确的区间里
    // 左子树的判断时，cur = root->left;
    // 当前值最大不能超过其父节点，maxNode = root
    // 当前值最小不能小于其父节点的最小值，（继承）minNode = minNode(父节点的传下来）
    // 右子树的判断时，cur = root->right;
    // 当前值最小不能小于其父节点，minNode = root
    // 当前值最大不能大于其父节点的最大值，（继承）minNode = maxNode(父节点的传下来）
    bool helper(TreeNode* cur, TreeNode* minNode, TreeNode* maxNode) {
        if (cur == NULL) return true;
        if ((maxNode && cur->val >= maxNode->val) || (minNode && cur->val <= minNode->val))
            return false;
        return helper(cur->left, minNode, cur) && helper(cur->right, cur, maxNode);
    }
};

inorder方法：

这是discussion中的解法，待回顾

public boolean isValidBST(TreeNode root) {
   if (root == null) return true;
   Stack<TreeNode> stack = new Stack<>();
   TreeNode pre = null;
   while (root != null || !stack.isEmpty()) {
      while (root != null) {
         stack.push(root);
         root = root.left;
      }
      root = stack.pop();
      if(pre != null && root.val <= pre.val) return false;
      pre = root;
      root = root.right;
   }
   return true;
}