[Leetcode]-- Binary Tree Level Order Traversal

/**
 * 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>> result = new ArrayList<ArrayList<Integer>>();
        
        if(root == null)
            return result;
            
        LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
        queue.add(root);
        //用来计数每一层有多少个Node
        int nextLevelCount = 1;
        
        while(!queue.isEmpty()){
            int curLevel = nextLevelCount;
            nextLevelCount = 0;
            ArrayList<Integer> lvl = new ArrayList<Integer>();
            // 此循环就是根据nextLevelCount来从队列里拿出多少个Node
            for(int i = 0; i < curLevel; i++){
                TreeNode tmp = queue.poll();
                lvl.add(tmp.val);
                if(tmp.left != null){
                    queue.add(tmp.left);
                    nextLevelCount++;
                }
                if(tmp.right != null){
                    queue.add(tmp.right);
                    nextLevelCount++;
                }
            }
            result.add(lvl);
        }
        return result;
    }
}