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

 int minabs=INT_MAX;

Minimum Absolute Difference in BST
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.
Example:
Input:

   1
    \
     3
    /
   2

Output:1
Explanation:
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3)

class Solution {
    int minabs=Integer.MAX_VALUE;
    TreeNode pre=null;//放外边否则递归会更新掉
    public int getMinimumDifference(TreeNode root) {
        inorder(root);
        return minabs;

    }
     
    void inorder(TreeNode root){
        if(root==null){
            return ;
        }
        inorder(root.left);

        if(pre!=null){//pre！=null的时候才有值
            minabs=Math.min(minabs,root.val-pre.val);//中序遍历root.val-pre.val就是绝对值
        }
        pre=root;//更新pre

        inorder(root.right);

    }
}