第22天|98.验证二叉搜索树 ,530.二叉搜索树的最小绝对差

98.验证二叉搜索树 

. - 力扣（LeetCode）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
     private long pre = Long.MIN_VALUE;

    public boolean isValidBST(TreeNode root) {
       if(root == null ){
           return true;
       }
       if(!isValidBST(root.left) || root.val <=pre){
           return false;
       }
       pre = root.val;
        return isValidBST(root.right);

    }
}

530.二叉搜索树的最小绝对差

. - 力扣（LeetCode）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    TreeNode pre;// 记录上一个遍历的结点
    int result = Integer.MAX_VALUE;
    public int minDiffInBST(TreeNode root) {
        if(root == null){
            return 0;
        }

        traversal(root);
        return result;
    }
  public void traversal(TreeNode root){
      if(root == null ){
          return;
      }
      traversal(root.left);
       if(pre!=null){
            result = Math.min(result,root.val-pre.val);
        }
        pre = root;
        //右
        traversal(root.right);
  }

}