783. 二叉搜索树节点最小距离

最新推荐文章于 2021-04-13 21:54:21 发布

lujian233

最新推荐文章于 2021-04-13 21:54:21 发布

阅读量137

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/lujian233/article/details/107552165

版权

leetcode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

定一个二叉搜索树的根节点 root，返回树中任意两节点的差的最小值。

在这里插入图片描述
leetcode

中序遍历：

/**
 * 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 minDiffInBST(TreeNode* root) {
        TreeNode *pre = NULL;
        int res = INT_MAX;
        midorder(root, res, pre);
        return res;
    }

    void midorder(TreeNode* root, int& res, TreeNode *&pre){
        if(!root) return;
        midorder(root->left, res, pre);
        if(pre) res = min(res, root->val - pre->val);
        pre = root;
        midorder(root->right, res, pre); 
    }
};

后序遍历：

/**
 * 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 minDiffInBST(TreeNode* root) {
        int temp = INT_MAX;
        if(!root) return temp;
        if(root->left){
            TreeNode *tmp = root->left;
            while(tmp->right) tmp = tmp->right;
            temp = min(temp, root->val - tmp->val);
        }
        if(root->right){
            TreeNode *tmp = root->right;
            while(tmp->left) tmp = tmp->left;
            temp = min(temp, tmp->val - root->val);
        }
        return min(temp, min(minDiffInBST(root->left), minDiffInBST(root->right)));
    }
};