leetcode--145. 二叉树的后序遍历

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

示例:

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

 1
  \
   2
  /
 3 

输出: [3,2,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 {
    vector<int> nums;
public:
    vector<int> postorderTraversal(TreeNode* root) {
        if (root == NULL){
            return nums;
        }
        postorderTraversal(root->left);
        postorderTraversal(root->right);
        nums.push_back(root->val);
        return nums;
    }
};
/*0ms,12.8MB*/

时间复杂度: O(n)
空间复杂度: O(n)

思路二：迭代法–两个栈

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> nums;
        if (root == NULL){
            return nums;
        }  
        stack<TreeNode*> s1;
        stack<TreeNode*> s2;
        s1.push(root);
        TreeNode* pNode = NULL;
        while (!s1.empty()){
            pNode = s1.top();
            s1.pop();
            if (pNode->left){
                s1.push(pNode->left);
            }
            if (pNode->right){
                s1.push(pNode->right);
            }
            s2.push(pNode);
        }
        while (!s2.empty()){
            nums.push_back(s2.top()->val);
            s2.pop();
        }
        return nums;
    }
};
/*0ms,10.9MB*/

时间复杂度: O(n)
空间复杂度: O(n)

思路三：迭代法–一个栈

class Solution {
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> nums;
        if (root == NULL){
            return nums;
        }  
        stack<TreeNode*> s1;
        s1.push(root);
        TreeNode* pNode = NULL;
        TreeNode* pre = root;
        while (!s1.empty()){
            pNode = s1.top();
            if (pNode->left && pre != pNode->left && pre != pNode->right){
                s1.push(pNode->left);
            } else if (pNode->right && pre != pNode->right){
                s1.push(pNode->right);
            } else {
                nums.push_back(pNode->val);
                s1.pop();
                pre = pNode;
            }
        }
        return nums;
    }
};
/*4ms,10.9MB*/

参考链接：
https://www.cnblogs.com/songwenjie/p/8955856.html