/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/classSolution{double last =-Double.MAX_VALUE;publicbooleanisValidBST(TreeNode root){if(root == null){returntrue;}if(isValidBST(root.left)){if(last < root.val){
last = root.val;returnisValidBST(root.right);}}returnfalse;}}