leetcode-145-Binary Tree Postorder Traversal

                             Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3

return [3,2,1].

Note: Recursive solution is trivial, could you do it iteratively?

后序遍历一棵树。

递归

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

非递归。

若一个节点 ，左右节点都为空，则输出。否则，分别将右节点和左节点压入栈中。

/**
 * 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: 
/*
    void houxu(TreeNode* root,vector<int>& s ) // 递归
    {
        if(!root) return;
        houxu(root->left,s);
        houxu(root->right,s);
        s.push_back(root->val);
    }
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int>s;
        houxu(root,s);
        return s;
    }
*/
    vector<int> postorderTraversal(TreeNode* root) // 非递归
    {
        TreeNode* cur;
        vector<int>v;
        if(root==NULL) return v;
        
        stack<TreeNode*>s;
        s.push(root);
        
        while(!s.empty()){
            cur=s.top();
            if(!cur->left&&!cur->right){
                v.push_back(cur->val);
                s.pop();
            }
            else{
                if(cur->right){
                    s.push(cur->right);
                    cur->right=NULL;
                }
                if(cur->left){
                    s.push(cur->left);
                    cur->left=NULL;
                }
            }
        }
        return v;
    }
};