Leetcode 530. Minimum Absolute Difference in BST

最新推荐文章于 2024-07-27 12:02:45 发布

原创最新推荐文章于 2024-07-27 12:02:45 发布 · 287 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode

Leetcode 同时被 2 个专栏收录

409 篇文章

订阅专栏

Algorithm

260 篇文章

订阅专栏

文章围绕Leetcode题目展开，包含题目描述和两种版本的解决方案，还给出了题目相关的参考链接https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/ 。

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

文章作者：Tyan
博客：noahsnail.com | 优快云 | 简书

1. Description

Minimum Absolute Difference in BST

2. Solution

Version 1

/**
 * 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 getMinimumDifference(TreeNode* root) {
        vector<int> values;
        inOrderTranverse(root, values);
        int min = INT_MAX;
        for(int i = 1; i < values.size(); i++) {
            int diff = values[i] - values[i - 1];
            if(min > diff) {
                min = diff;
            }
        }
        return min;
    }

private:
    void inOrderTranverse(TreeNode* root, vector<int>& values) {
        if(!root) {
            return;
        }
        if(root->left) {
            inOrderTranverse(root->left, values);
        }
        values.push_back(root->val);
        if(root->right) {
            inOrderTranverse(root->right, values);
        }
    }
};

Version 2

/**
 * 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 getMinimumDifference(TreeNode* root) {
        int min = INT_MAX;
        int current = -1;
        inOrderTranverse(root, min, current);
        return min;
    }

private:
    void inOrderTranverse(TreeNode* root, int& min, int& current) {
        if(!root) {
            return;
        }
        if(root->left) {
            inOrderTranverse(root->left, min, current);
        }
        if(current != -1) {
            if(min > root->val - current) {
                min = root->val - current;
            }
        }
        current = root->val;
        if(root->right) {
            inOrderTranverse(root->right, min, current);
        }
    }
};