zlatan的算法笔记12.1--二叉树的前中后序遍历【非递归】

最新推荐文章于 2024-08-13 14:56:59 发布

zlatanYang

最新推荐文章于 2024-08-13 14:56:59 发布

阅读量467

点赞数

文章标签：算法 leetcode 职场和发展

本文链接：https://blog.csdn.net/qq_43408360/article/details/127508248

版权

代码部分

前序

class Solution {
public:
    vector<int> preorderTraversal(TreeNode* root) {
        stack<TreeNode*> st;
        vector<int> result;
        if(root == nullptr) {
            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> inorderTraversal(TreeNode* root) {
        vector<int> result;
        stack<TreeNode*> st;
        TreeNode* cur = root;
        while(!st.empty() || cur != nullptr) {
            if(cur != nullptr) {
                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<int> postorderTraversal(TreeNode* root) {
        vector<int> result;
        stack<TreeNode*> st;
        if(root == nullptr) {
            return result;
        }
        st.push(root);
        while(!st.empty()) {
            TreeNode* node = st.top();
            st.pop();
            result.push_back(node -> val);
            if(node -> left) {
                st.push(node -> left);
            }
            if(node -> right) {
                st.push(node -> right);
            }
        }
        reverse(result.begin(), result.end());
        return result;
    }
};