【LeetCode】LeetCode 145.二叉树的后序遍历

LeetCode 145.二叉树的后序遍历

题目链接：https://leetcode.cn/problems/binary-tree-postorder-traversal/

题目

解答

迭代方法

后序遍历的顺序是左→右→中，只需要调整前序遍历的代码顺序，变成中→右→左的遍历顺序，然后反转result数组，输出结果的顺序就是左→右→中了。

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> result;
        TreeNode* cur = root;
        stack<TreeNode*> st;

        if(cur != NULL) st.push(cur);

        while(!st.empty()){
            cur = st.top();
            st.pop();
            result.push_back(cur->val);
            if(cur->left)   st.push(cur->left);
            if(cur->right)  st.push(cur->right);
        }

        reverse(result.begin(),result.end());

        return result;
    
    }
};

递归方法

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

        return result;
    } 
};