- 二叉搜索树
public boolean isSearchTree(TreeNode root,int min, int max){
if(root == null){
return true;
}
if(root.val <= min || root.val >= max){
return false;
}else{
return isSearchTree(root