验证二叉搜索树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 **/

***## /迭代法***

**
class Solution {
    public boolean isValidBST(TreeNode root) {
        return dfs(root,null,null);
    }
boolean dfs(TreeNode root,Integer l ,Integer r){
    if(root==null)
    return true;
    if(l!=null&&l>=root.val)
    return false;
    if(r!=null&&r<=root.val)
    return false;
return dfs(root.left,l,root.val)&&dfs(root.right,root.val,r);
}
}

中序遍历

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    long pre=Long.MIN_VALUE;
    public boolean isValidBST(TreeNode root) {
        if(root==null)
        return true;
        if(!isValidBST(root.left))
        return false;
if(pre>=root.val)
return false;
pre=root.val;
return isValidBST(root.right);
    }
}