【剑指offer专项】II 047. 二叉树剪枝

最新推荐文章于 2024-08-02 17:39:14 发布

小莫同学Std

最新推荐文章于 2024-08-02 17:39:14 发布

阅读量72

点赞数

分类专栏：刷题笔记文章标签：剪枝算法数据结构

本文链接：https://blog.csdn.net/qq_42800363/article/details/125113153

版权

刷题笔记专栏收录该内容

7 篇文章 0 订阅

订阅专栏

二叉树递归与迭代的区别

以此题为例，区别递归和迭代的区别

1.先序遍历

递归：

void preorderTra(TreeNode* root, vector<int>& nodes) {
    if (root == nullptr) {
        return;
    }
    node.push_back(root->val);
    preorderTra(root->left, nodes);
    preorderTra(root->right, nodes);
}

迭代：

void preorderTra(TreeNode* root, vector<int>& nodes) {
    stack<TreeNode*> sta;
    TreeNode* cur = root;
    while (cur != nullptr || !sta.empty()) {
        while (cur != nullptr) {
            nodes.push_back(cur->val);
            sta.push(cur);
            cur = cur->left;
        }

        cur = sta.top();
        sta.pop();
        cur = cur->right;
    }
}

2.中序遍历

递归：

void inorderTra(TreeNode* root, vector<int>& nodes) {
    if (root == nullptr) {
        return;
    }
    inorderTra(root->left, nodes);
    node.push_back(root->val);
    inorderTra(root->right, nodes);
}

迭代：

void inorderTra(TreeNode* root, vector<int>& nodes) {
    stack<TreeNode*> sta;
    TreeNode* cur = root;
    while (cur != nullptr || !sta.empty()) {
        while (cur != nullptr) {
            sta.push(cur);
            cur = cur->left;
        }

        cur = sta.top();
        sta.pop();
        nodes.push_back(cur->val);
        cur = cur->right;
    }
}

3.后序遍历

递归：

void postorderTra(TreeNode* root, vector<int>& nodes) {
    if (root == nullptr) {
        return;
    }
    postorderTra(root->left, nodes);
    postorderTra(root->right, nodes);
    node.push_back(root->val);
}

迭代：

void postorderTra(TreeNode* root, vector<int>& nodes) {
    stack<TreeNode*> sta;
    TreeNode* cur = root;
    TreeNode* prev = nullptr;
    while (cur != nullptr || !sta.empty()) {
        while (cur != nullptr) {
            sta.push(cur);
            cur = cur->left;
        }

        cur = sta.top();
        if (cur->right != nullptr && cur->right != prev) {
            cur = cur->right;
        }
        else {
            sta.pop();
            nodes.push_back(cur->val);
            prev = cur;
            cur = nullptr;
        }   
    }
}