# Leetcode no. 98

79人阅读 评论(0)

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.

/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isValidBST(TreeNode root) {
return isValidBST(root, Long.MIN_VALUE, Long.MAX_VALUE);
}
private boolean isValidBST(TreeNode root, long lower, long upper){
if (root==null) return true;
if (root.val>=upper || root.val<=lower) return false;
return isValidBST(root.left, lower, root.val) && isValidBST(root.right, root.val, upper);
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：8255次
• 积分：1129
• 等级：
• 排名：千里之外
• 原创：111篇
• 转载：4篇
• 译文：0篇
• 评论：0条
文章分类
评论排行