首页 > itarticle > [leetcode] problem 530 – minimum absolute difference in bst

[leetcode] problem 530 – minimum absolute difference in bst

admin 11月 13, 2020 0

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

Example

Input:

Output:
1

Explanation:
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).

Note

There are at least two nodes in this BST.

Code

public class  {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}

private int min = Integer.MAX_VALUE;
private int prev = -1;

public int getMinimumDifference(TreeNode root) {
    inorder(root);
    return min;
}

private void inorder(TreeNode root) {
    if (root == null)
        return;

    inorder(root.left);

    if (prev != -1)
        min = Math.min(min, root.val - prev);

    prev = root.val;

    inorder(root.right);
}