二叉树的前序，中序和后序遍历的递归与迭代代码

最新推荐文章于 2023-01-02 16:45:15 发布

孤独的拉普拉斯

最新推荐文章于 2023-01-02 16:45:15 发布

阅读量177

点赞数

分类专栏：面试题 C++ 算法文章标签：二叉树算法 leetcode stack

本文链接：https://blog.csdn.net/qq_33551749/article/details/107848528

版权

算法同时被 3 个专栏收录

12 篇文章 0 订阅

订阅专栏

C++

6 篇文章 0 订阅

订阅专栏

面试题

3 篇文章 0 订阅

订阅专栏

前序遍历

递归借助的程序的运行时栈，所以改为迭代时，本质上借助stack去模拟运行时栈。

递归

/**
 * 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 {
    vector<int> result={};
public:
    vector<int> preorderTraversal(TreeNode* root) {
        if(root==NULL) return result;
        result.push_back(root->val);
        preorderTraversal(root->left);
        preorderTraversal(root->right);
        return result;
    }
};

迭代

/**
 * 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 {
	vector<int> result={};
public:
    vector<int> preorderTraversal(TreeNode* root) {
        if(root==NULL) return result;
        stack<TreeNode*> s;
        s.push(root);
        //dfs
        while(!s.empty()){
            auto curr=s.top();
            s.pop();
            result.push_back(curr->val);
            if(curr->right) s.push(curr->right);
            if(curr->left) s.push(curr->left);
        }
        return result;
    }
};

中序遍历

递归

/**
 * 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 {
    vector<int> result={};
public:
    vector<int> inorderTraversal(TreeNode* root) {
        if(root==NULL) return result;
        inorderTraversal(root->left);
        result.push_back(root->val);
        inorderTraversal(root->right);
        return result;
    }
};

迭代

/**
 * 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 {
    vector<int> result={};
public:
    vector<int> inorderTraversal(TreeNode* root) {
        if(root==NULL) return result;
        stack<TreeNode*> s;
        s.push(root);
        while(!s.empty()){
            while(root->left){
                s.push(root->left);
                root=root->left;
            }
            auto curr=s.top();
            s.pop();
            result.push_back(curr->val);
            if(curr->right){
                s.push(curr->right);
                root=curr->right;
            }
        }
        return result;
    }
};

后序遍历

递归

/**
 * 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 {
    vector<int> result={};
public:
    vector<int> postorderTraversal(TreeNode* root) {
        if(root==NULL) return result;
        postorderTraversal(root->left);
        postorderTraversal(root->right);
        result.push_back(root->val);
        return result;
    }
};

迭代

/**
 * 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:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> ans={};
        if(root){
            stack<TreeNode*> s;
            s.push(root);
            while(!s.empty()){
                auto curr=s.top();
                s.pop();
                ans.push_back(curr->val);
                if(curr->left)
                    s.push(curr->left);
                if(curr->right)
                    s.push(curr->right);
            }
            reverse(ans.begin(),ans.end());
        }
        return ans;
    }
};