Validate Binary Search Tree

class TreeNode{int value;TreeNode left;TreeNode right;TreeNode(int value){this.value = value;}}boolean isSearchTree(TreeNode root, int min, int max){if(root==null)return true;if(root.value<=min || root.value >=max)return false;return isSearchTree(root.left, min, root.value) && isSearchTree(root.right, root.value, max);}