Leetcode—99. 恢复二叉搜索树【中等】

最新推荐文章于 2024-10-08 10:36:00 发布

源代码•宸

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量240

点赞数 8

分类专栏： LeetCode刷题文章标签： leetcode 算法职场和发展 c++ 回溯 dfs 栈

本文链接：https://blog.csdn.net/qq_44631615/article/details/140270431

版权

LeetCode刷题专栏收录该内容

393 篇文章 5 订阅

订阅专栏

2024每日刷题（140）

Leetcode—99. 恢复二叉搜索树

在这里插入图片描述

回溯法实现代码

/**
 * 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 {
public:
    void recoverTree(TreeNode* root) {
        TreeNode* pred = nullptr;
        TreeNode* first = nullptr;
        TreeNode* last = nullptr;

        function<void(TreeNode*)> dfs = [&](TreeNode* node) {
            if(node == nullptr) {
                return;
            }

            dfs(node->left);
            if(pred && node->val < pred->val) {
                last = node;
                if(first == nullptr) {
                    first = pred;
                } else {
                    return;
                }
            }
            pred = node;
            dfs(node->right);
        };

        dfs(root);
        swap(first->val, last->val);
    }
};

运行结果

在这里插入图片描述

栈实现代码

/**
 * 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 {
public:
    void recoverTree(TreeNode* root) {
        stack<TreeNode*> st;
        TreeNode* first = nullptr;
        TreeNode* last = nullptr;
        TreeNode* pred = nullptr;

        while(!st.empty() || root != nullptr) {
            while(root != nullptr) {
                st.push(root);
                root = root->left;
            }
            root = st.top(), st.pop();
            if(pred && root->val < pred->val) {
                last = root;
                if(first == nullptr) {
                    first = pred;
                } else {
                    break;
                }
            }
            pred = root;
            root = root->right;
        }

        swap(first->val, last->val);
    }
};