给定一个二叉搜索树的根节点 root，返回树中任意两节点的差的最小值

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int pre=-1;
    int ans=100000;
    public int minDiffInBST(TreeNode root) {
        f(root);
        return ans;
    }
    public void f(TreeNode root){
        if(root!=null){
             f(root.left);
        if(pre==-1){
            pre=root.val;
        }else {
            ans=Math.min(root.val-pre,ans);
            pre=root.val;
        }
        f(root.right);
        }
       
    }
}