leetcode145. 二叉树的后序遍历

题目描述

给定一个二叉树，返回它的 后序 遍历。

 

示例

输入: [1,null,2,3]  
   1
    \
     2
    /
   3 

输出: [3,2,1]
进阶: 递归算法很简单，你可以通过迭代算法完成吗？

 

思路1

递归。

 

代码

/**
 * 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> res;
        postorder(root, res);
        return res;
    }
    
    void postorder(TreeNode* root, vector<int>& res){
        if (!root) return;
        postorder(root->left, res);
        postorder(root->right, res);
        res.push_back(root->val);
    }
};

 

思路2

迭代。

 

代码

/**
 * 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> res;
        stack<TreeNode*> s1, s2;
        while (root || !s1.empty()){
            while (root){
                s1.push(root);
                s2.push(root);
                root = root->right;
            }
            if (!s1.empty()){
                root = s1.top();
                s1.pop();
                root = root->left;
            }
        }
        while (!s2.empty()){
            res.push_back(s2.top()->val);
            s2.pop();
        }
        return res;
    }
    
};