LeetCode#530: Minimum Absolute Difference in BST

Description

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).

Solution

这题要求求出最小的绝对差值。我们知道一个二叉搜索树的中序遍历是顺序的，所以上面的例子中的中序遍历结果为：1 2 3，我们将当前节点与上一个节点的差值不断和已知最小差值作比较即可。根据这种思路写出以下代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
	int min = Integer.MAX_VALUE;
	TreeNode prev;
	
    public int getMinimumDifference(TreeNode root) {
        getMinimumDifferenceCore(root);
        return min;
    }
    
    private void getMinimumDifferenceCore(TreeNode root) {
    	if(root == null) 
    		return;
    	getMinimumDifferenceCore(root.left);
    	if(prev != null) {
    		min = Math.min(min, root.val - prev.val);
    	}
    	prev = root;
    	getMinimumDifferenceCore(root.right);
    }
}