530. Minimum Absolute Difference in BST

最新推荐文章于 2022-08-14 16:27:15 发布

weixin_30528371

最新推荐文章于 2022-08-14 16:27:15 发布

阅读量41

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/hutonm/p/6530388.html

本文介绍了一种算法，用于解决给定二叉搜索树中任意两节点间最小绝对差值的问题。通过递归中序遍历的方法，实现了一个高效的解决方案，并提供了完整的C++代码实现。

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

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

Note: There are at least two nodes in this BST.

给一棵二叉搜索树，找到他的任意两个节点的差的最小值

刚开始理解错了，误认为求两个相邻节点的差的

对于树的便利，我还是不够熟练啊

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int prev = -1;
    int min = INT_MAX;
    void GetMinDeff(TreeNode *root){
        if(root == NULL)    return;
        
        GetMinDeff(root->left);
        int diff;
        if(prev == -1)
            prev = root->val;
        else{
            diff = fabs(root->val - prev);
            if(min > diff)
                min = diff;
            prev = root->val;
        }
        GetMinDeff(root->right);
    }
    int getMinimumDifference(TreeNode* root) {
        GetMinDeff(root);
        return min;
        
    }
};