题目
代码
class Solution {
private int minNum = Integer.MAX_VALUE;
private TreeNode pre = null;
public int getMinimumDifference(TreeNode root) {
minimumDifference(root);
return minNum;
}
private void minimumDifference(TreeNode root) {
if (root == null) return;
minimumDifference(root.left);
if (pre != null) {
minNum = Math.min(minNum, root.val - pre.val);
}
pre = root;
minimumDifference(root.right);
}
}