关于BST相关的题目

最新推荐文章于 2024-09-14 20:30:05 发布

Hanknet

最新推荐文章于 2024-09-14 20:30:05 发布

阅读量55

点赞数

分类专栏： leetCode 文章标签：算法数据结构 c++ Powered by 金山文档

本文链接：https://blog.csdn.net/Hanknet/article/details/128864448

版权

leetCode 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

530. 二叉搜索树的最小绝对差

方法：递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
private:
    int res = INT_MAX;
    TreeNode* pre = NULL;
    void dfs(TreeNode* cur) {
        if (cur == NULL) return;
        dfs(cur->left);
        if (pre != NULL) res = min(res, cur->val - pre->val);
        pre = cur;
        dfs(cur->right);
    }
public:
    int getMinimumDifference(TreeNode* root) {
        dfs(root);
        return res;
    }
};

$时间复杂度O(n)，空间复杂度O(n)

方法：迭代

class Solution {
public:
    int getMinimumDifference(TreeNode* root) {
        int res = INT_MAX;
        stack<TreeNode*> st;
        TreeNode* cur = root;
        TreeNode* pre = NULL;
        while (cur != NULL || !st.empty()) {
            if (cur != NULL) {
                st.push(cur);
                cur = cur->left;
            } else {
                cur = st.top();
                st.pop();
                if (pre != NULL) res = min(res, cur->val - pre->val);
                pre = cur;
                cur = cur->right;
            }
        }
        return res;
    }
};

$时间复杂度O(n)，空间复杂度O(n)

501. 二叉搜索树中的众数

方法：递归

class Solution {
private:
    void dfs(TreeNode* cur, unordered_map<int, int>& vis) {
        if (cur == NULL) return ;
        dfs(cur->left, vis);
        ++vis[cur->val];
        dfs(cur->right, vis); 
        return ;
    }

    bool static cmp(const pair<int, int>& a, const pair<int, int>& b) {
        return a.second > b.second;
    }
public:
    vector<int> findMode(TreeNode* root) {
        vector<int> res;
        unordered_map<int, int> vis;
        if (root == NULL) return res;
        dfs(root, vis);
        vector<pair<int, int>> vec(vis.begin(), vis.end());
        sort(vec.begin(), vec.end(), cmp);
        res.emplace_back(vec[0].first);
        for (int i = 1; i < vec.size(); ++i) {
            if (vec[i].second == vec[0].second) res.emplace_back(vec[i].first);
            else break;
        }
        return res;
    }
};

$时间复杂度O(n)，空间复杂度O(n)

方法：迭代

class Solution {
public:
    vector<int> findMode(TreeNode* root) {
        stack<TreeNode*> st;
        TreeNode* cur = root;
        TreeNode* pre = NULL;
        vector<int> res;
        int cnt = 0, maxn = 0;
        while (cur != NULL || !st.empty()) {
            if (cur != NULL) {
                st.push(cur);
                cur = cur->left;
            } else {
                cur = st.top();
                st.pop();
                if (pre == NULL) cnt = 1;
                else if (pre->val == cur->val) ++cnt;
                else cnt = 1;
                if (cnt == maxn) res.emplace_back(cur->val);
                if (cnt > maxn) {
                    maxn = cnt;
                    res.clear();
                    res.emplace_back(cur->val);
                }
                pre = cur;
                cur = cur->right;
            }
        }
        return res;
    }
};

$时间复杂度O(n)，空间复杂度O(n)

236. 二叉树的最近公共祖先

方法：递归

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (root == p || root == q || root == NULL) return root;
        TreeNode* l = lowestCommonAncestor(root->left, p, q);
        TreeNode* r = lowestCommonAncestor(root->right, p, q);
        if (l != NULL && r != NULL) return root;
        if (l == NULL) return r;
        return l;
    }
};

$时间复杂度O(n)，空间复杂度O(n)