class Solution {
Long pre = Long.MIN_VALUE;
public boolean isValidBST(TreeNode root) {
if (root==null){
return true;
}
if (!isValidBST(root.left)){
return false;
}
if (root.val<=pre){
return false;
}
pre = (long)root.val;
return isValidBST(root.right);
}
}