补day21

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 getMinimumDifference(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);
    }
 }