p102

 

 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class  {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> ansList = new ArrayList<List<Integer>>();
		dp(root, ansList, 0);
		return ansList;
	}

	public void dp(TreeNode root, List<List<Integer>> ans, int deep) {
		if (root == null)
			return;
		if (ans.size() < deep + 1) {
			List<Integer> list = new ArrayList<Integer>();
			ans.add(list);
		}
		List<Integer> aList = ans.get(deep);
		aList.add(root.val);
		dp(root.left, ans, deep + 1);
		dp(root.right, ans, deep + 1);
	}
}