530. Minimum Absolute Difference in BST-CSDN博客

本文介绍了一种高效算法，用于求解二叉搜索树中任意两节点间最小绝对差值的问题。通过比较根节点与其左右子树的极端值，该算法能在O(n)时间内找到最优解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question

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

The minimum absolute difference is 37, which is the difference between 4443 and 4406.

代码实现

1) we need compare nearby
2) every root to rightest of left subtree, every root to leftest of right subtree.
this method beats 97% of submission.

public class Solution {
            public int GetMinimumDifference(TreeNode root)
            {
               //we need compare root to root.right, root to root.left, 
               //every root to rightest of left subtree, every root to leftest of right subtree
                int min = getNearby(root);
                return Math.Min(min,getRootDiff(root));                            
            }

            //we need compare root to root.right, root to root.left, 
            private int getNearby(TreeNode root)
            {
                if (root.left == null && root.right == null) return Int32.MaxValue;
                int min = 0;
                if (root.left != null)
                {
                    min = root.val - root.left.val;
                    min = Math.Min(min, getNearby(root.left));
                }
                if (root.right != null)
                {
                    if (root.left != null)
                    {
                        min = Math.Min(min, root.right.val - root.val);
                        min = Math.Min(min, getNearby(root.right));
                    }
                    else
                    {
                        min = root.right.val - root.val;
                        min = Math.Min(min, getNearby(root.right));
                    }
                }
                return min;
            }
            //every root to rightest of left subtree, every root to leftest of right subtree.
            private int getRootDiff(TreeNode root)
            {            
                int min = Int32.MaxValue;
                if (root == null) return min;
                if (root.left == null && root.right == null) return min;
                var node = root;
                //root to rightest of left subtree
                if (root.left != null)
                {
                    node = node.left;
                    while (node.right != null) node = node.right;
                    min = Math.Min(Math.Abs(root.val - node.val), min);
                }

                //root to leftest of right subtree
                if (root.right != null)
                {
                    node = root.right;
                    while (node.left != null) node = node.left;
                    min = Math.Min(Math.Abs(node.val - root.val), min);
                }
                min = Math.Min(min, getRootDiff(root.left));
                min = Math.Min(min, getRootDiff(root.right));
                return min;
            }

}