每日一道Leetcode - 783. 二叉搜索树节点最小距离【中序遍历】

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    Integer pre,ans;
    public int minDiffInBST(TreeNode root) {
        // 中序遍历从小到大输出
        pre = null;
        ans = Integer.MAX_VALUE;
        mid(root);
        return ans;
    }
    public void mid(TreeNode node){
        if(node==null) return ;
        mid(node.left);
        if(pre!=null){
            ans = Math.min(ans,node.val-pre);
        }
        pre = node.val;
        mid(node.right);
    }
}