代码随想录算法训练营Day11 |递归遍历，迭代遍历，统一迭代

递归遍历

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);
        // //后序遍历
        // traversal(cur->left,vec);
        // traversal(cur->right,vec);
        // vec.push_back(cur->val); 
        // //中序遍历
        // traversal(cur->left,vec);
        // vec.push_back(cur->val);
        // traversal(cur->right,vec);  
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int>result;
        traversal(root,result);
        return result;
    }
};

迭代遍历

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

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        //后序遍历
        stack<TreeNode*>st;
        vector<int>result;
        if(root == NULL) return result;
        st.push(root);
        while(!st.empty()){
            TreeNode* node=st.top();
            st.pop();
            result.push_back(node->val);
            if(node->right) st.push(node->right);
            if(node->left)  st.push(node->left);
        } 
        //改变前序遍历中的左右顺序，变为中右左 最后翻转顺序 变为左右中 即为后序遍历
        reverse(result.begin(),result.end());
        return result;
    }
};

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

统一迭代 

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        queue<TreeNode*> que;
        if (root != NULL) que.push(root);
        vector<vector<int>> result;
        while (!que.empty()) {
            int size = que.size();
            vector<int> vec;
            // 每次while循环都会创建一个新的vec对象来存储当前层的节点值，并将这个vec对象添加到结果result中
            // 最终，result是一个二维向量，其中每个内部向量vec代表了一层的节点值
            for (int i = 0; i < size; i++) {
                TreeNode* node = que.front();
                que.pop();
                vec.push_back(node->val);
                if (node->left)  que.push(node->left);
                if (node->right) que.push(node->right);
            }
            result.push_back(vec);
        }
        return result;
    }
};