@@ -0,0 +1,702 @@
+/**%0A * Definition for binary tree%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public boolean isValidBST(TreeNode root) %7B%0A        return isValidBSTRecur(root, Integer.MIN_VALUE, Integer.MAX_VALUE);%0A    %7D%0A    %0A    private boolean isValidBSTRecur(TreeNode root, int min, int max) %7B%0A        if (root == null) %7B%0A            return true;%0A        %7D%0A        %0A        if (root.val %3C= min %7C%7C root.val %3E= max) %7B%0A            return false;%0A        %7D%0A        %0A        return isValidBSTRecur(root.left, min, root.val) && isValidBSTRecur(root.right, root.val, max);%0A    %7D%0A%7DValidate Binary Search Tree%0A

Create Validate_Binary_Search_Tree.java