BST的特点:
1、左子树所有节点的值都小于等于根节点的值
2、右子树所有节点的值都大于等于根节点的值
3、左右子树都是BST
public clss Main
{
private static int lastVisit = Integer.MIN_VALUE;
public static boolean isBST(TreeNode root)
{
if(root == null)
return true;
boolean judgeLeft = isBST(root.left);
if(root.val >= lastVisit && judegLeft)
{
lastVisit = root.val;
}
else
{
return false;
}
boolean judgeRight = isBST(root.right);
return judgeRight;
}
}