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

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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.ArrayList;
import java.util.Stack;
public class Solution {
    public ArrayList<Integer> postorderTraversal(TreeNode root) {
        ArrayList<Integer> out=new ArrayList<Integer>();
        Stack<TreeNode> s=new Stack<TreeNode>();
        Stack<Integer> s2=new Stack<Integer>();
        if(root==null){
            return out;
        }
        s.push(root);
        while(!s.isEmpty()){
            TreeNode temp=s.pop();
            if(temp.left!=null){
                s.push(temp.left);
            }
             
            if(temp.right!=null){
                s.push(temp.right);
            }
            s2.push(temp.val);
        }
        while(!s2.isEmpty()){
            out.add(s2.pop());
        }
        return out;
    }
}

方法二：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.ArrayList;
public class Solution {
    ArrayList<Integer> out =new ArrayList<Integer>();
    public ArrayList<Integer> postorderTraversal(TreeNode root) {
        if(root==null){
            return out;
        }
        
        if(root.left!=null)
        postorderTraversal(root.left);
        if(root.right!=null)
        postorderTraversal(root.right);
        out.add(root.val);
        return out;
    }
}