leetcode - 98.Validate Binary Search Tree

最新推荐文章于 2020-03-27 16:29:10 发布

xiedacon

最新推荐文章于 2020-03-27 16:29:10 发布

阅读量239

点赞数

分类专栏： leetcode题集文章标签： leetcode

本文链接：https://blog.csdn.net/qq_27350929/article/details/64125000

版权

leetcode题集专栏收录该内容

96 篇文章 0 订阅

订阅专栏

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.

Solution1:

  public boolean isValidBST(TreeNode root) {
    return isValidBST(root, Long.MIN_VALUE, Long.MAX_VALUE);
  }

  private boolean isValidBST(TreeNode root, long left, long right) {
    if (root == null)
      return true;
    if ((root.left == null || (root.left.val < root.val && root.left.val > left))
        && (root.right == null || (root.right.val > root.val && root.right.val < right)))
      return isValidBST(root.left, left, root.val) && isValidBST(root.right, root.val, right);
    return false;
  }

Solution2:

better

  public boolean isValidBST(TreeNode root) {
    return isValidBST(root, Long.MIN_VALUE, Long.MAX_VALUE);
  }

  private boolean isValidBST(TreeNode root, long left, long right) {
    if (root == null)
      return true;
    if (root.val <= left || root.val >= right)
      return false;
    return isValidBST(root.left, left, root.val) && isValidBST(root.right, root.val, right);
  }