102. 二叉树的层序遍历

层序遍历框架固定，先写出固定的框架；然后做些修改

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

        ArrayList<List<Integer>> result = new ArrayList<>();
        ArrayList<Integer> level = new ArrayList<>();

        Queue<TreeNode> que = new LinkedList<>();
        que.offer(node);
        int levelSize = 1;

        while(!que.isEmpty()){
            TreeNode poll = que.poll();
            level.add(poll.val);
            levelSize -= 1;

            if(poll.left != null){
                que.offer(poll.left);
            }
            if(poll.right != null){
                que.offer(poll.right);
            }

            if(levelSize == 0){
                levelSize = que.size();
                result.add(level);
                level = new ArrayList<Integer>();
            }
        }

        return result;
    }
}