代码随想录算法训练营第十二天 | 递归遍历；迭代遍历；统一迭代

a729053228

已于 2023-09-07 17:39:49 修改

阅读量121

点赞数

文章标签：算法数据结构

于 2023-09-06 22:07:23 首次发布

本文链接：https://blog.csdn.net/a729053228/article/details/132723605

版权

144. 二叉树的前序遍历

class Solution {
public:
    void traversal(TreeNode* cur,vector<int>& vec){
        if(cur==NULL) return;
        vec.push_back(cur->val);
        traversal(cur->left,vec);
        traversal(cur->right,vec);
    }
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> result;
        traversal(root,result);
        return result;
    }
};

非递归：（中右左）

class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        stack<TreeNode*> stk;
        vector<int> result;
        if(root==NULL) return result;
        stk.push(root);
        while(!stk.empty()){
            TreeNode* node = stk.top();
            stk.pop();
            result.push_back(node->val);
            if(node->right!=NULL){
                stk.push(node->right);
            }
            if(node->left!=NULL){
                stk.push(node->left);
            }
        }
        return result;
    }
};

145. 二叉树的后序遍历

class Solution {
public:
    void traversal(TreeNode* cur,vector<int>& vec){
        if(cur==NULL) return;
        traversal(cur->left,vec);
        traversal(cur->right,vec);
        vec.push_back(cur->val);
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> result;
        traversal(root,result);
        return result;
    }
};

非递归：(只是跟前序遍历换了个顺序，中左右）

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> result;
        stack<TreeNode*> stk;
        if(root==NULL) return result;
        stk.push(root);
        while(!stk.empty()){
            TreeNode* node = stk.top();
            stk.pop();
            result.push_back(node->val);
            if(node->left!=NULL){
                stk.push(node->left);
            }
            if(node->right!=NULL){
                stk.push(node->right);
            }
        }
        reverse(result.begin(),result.end());
        return result;
    }
};

94. 二叉树的中序遍历

class Solution {
public:
    void traversal(TreeNode* cur,vector<int>& vec){
        if(cur==NULL) return;
        traversal(cur->left,vec);
        vec.push_back(cur->val);
        traversal(cur->right,vec);
    }
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> result;
        traversal(root,result);
        return result;
    }
};

非递归：一直走到最左，再弹出元素接着向右；

class Solution {
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> result;
        stack<TreeNode*> stk;
        TreeNode* node = root;
        while(node!=NULL||!stk.empty()){
            if(node!=NULL){
                stk.push(node);
                node = node->left;
            }else{
                node = stk.top();
                stk.pop();
                result.push_back(node->val);
                node = node->right;
            }
        }
        return result;
    }
};