Leetcode 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?

分析：

后序遍历的顺序为左右中。这道题的技巧在于前序遍历顺序是中左右，顺序颠倒为中右左，刚好是后序遍历的倒序。只需要多用一个栈记录中右左，再倒过来即为后序遍历。

Java代码实现：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<Integer>();
        if(root==null)
            return result;
            
        Stack<TreeNode> s = new Stack<TreeNode>();
        Stack<Integer> r = new Stack<Integer>();
        s.push(root);
        while(!s.isEmpty())
        {
            TreeNode node = s.pop();
            r.push(node.val);
            if(node.left!=null)
                s.push(node.left);
            if(node.right!=null)
                s.push(node.right);
        }
        while(!r.isEmpty())
        {
            result.add(r.pop());
        }
        return result;
    }
}