【剑指offer】二叉树的后序遍历

描述：

给出一棵二叉树，返回其节点值的后序遍历。

样例：

给出一棵二叉树 {1,#,2,3},

   1
    \
     2
    /
   3

返回 [3,2,1]

java 代码：

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Postorder in ArrayList which contains node values.
     */
    private ArrayList<Integer> list = new ArrayList<Integer>();
	
	public ArrayList<Integer> postorderTraversal(TreeNode root) {
		
		if(root == null){
			return list;
		}
		
		traversal(root);
		return list;
    }
	
	public void traversal(TreeNode root) {
		if(root.left!=null){
			traversal(root.left);
		}
		
		if(root.right!=null){
			traversal(root.right);
		}
		list.add(root.val);
	} 
}