[leet code] Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

==================

Analysis:

Exact the same as [leet code] Binary Tree Level Order Traversal II.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ArrayList<ArrayList<Integer>> levelOrder(TreeNode root) {
        ArrayList<ArrayList<Integer>> rs = new ArrayList<ArrayList<Integer>>();
        if(root == null) return rs;
        helper(root, rs, 1);
        return rs;
    }
    
    public void helper(TreeNode node, ArrayList<ArrayList<Integer>> rs, int depth){
        if(node == null) return;
        ArrayList<Integer> temp = new ArrayList<Integer>();
        
        // check if this level has already exist
        if(rs.size()<depth) rs.add(temp);
        else temp = rs.get(depth-1);
        
        temp.add(node.val);

        helper(node.left, rs, depth+1);
        helper(node.right, rs, depth+1);
    }
}