题目描述:
代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isValidBST(TreeNode root) {
return isVaild(root,null,null);
}
boolean isVaild(TreeNode root,TreeNode min,TreeNode max){//min左边 max右边 因为要保证左边的全部小于根节点,右边的全部大于根节点 min和max 相当于两个边界
if(root==null){
return true;
}
if(min!=null&&root.val<=min.val){
return false;
}
if(max!=null&&root.val>=max.val){
return false;
}
return isVaild(root.left,min,root)&&isVaild(root.right,root,max);
}
}