class Solution {
int pre = -1;
int minDif = Integer.MAX_VALUE;
public int getMinimumDifference(TreeNode root) {
dfs(root);
return minDif;
}
public void dfs(TreeNode root) {
if (root == null) {
return;
}
dfs(root.left);
if (pre != -1) {
minDif = Math.min(minDif, root.val - pre);
}
pre = root.val;
dfs(root.right);
}
}