LintCode | 68. 二叉树的后序遍历

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

/**
* 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.
     */
    ArrayList<Integer> list = new ArrayList<Integer>();

    public ArrayList<Integer> postorderTraversal(TreeNode root) {
        if(root == null) return list;
        postorderTraversal(root.left);
        postorderTraversal(root.right);
        list.add(root.val);
        return list;
    }
}