题目:
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.
题意:
给定一棵二叉树,判定它是否为一棵有效的二叉搜索树(BST)。
假设二叉搜索树(BST)的定义如下:
- 节点左子树上的节点值都小于这个节点值 .
- 节点右子树上的节点值都大于这个节点值 .
- 左右子树均必须为二叉搜索树 .
算法分析:
参考 http://www.programcreek.com/2012/12/leetcode-validate-binary-search-tree-java/
通过递归解法,分别检查每个节点,节点的左子树上的值均小于节点值,节点的又子树上的值均大于节点值。
AC代码:
<span style="font-family:Microsoft YaHei;font-size:12px;">public class Solution
{
public boolean isValidBST(TreeNode root)
{
return isValidBST(root, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY);
}
public boolean isValidBST(TreeNode p, double min, double max)
{
if(p==null)
return true;
if(p.val <= min || p.val >= max)
return false;
return isValidBST(p.left, min, p.val) && isValidBST(p.right, p.val, max);
}
}</span>