LeetCode ---- 二叉树的层次遍历

给定一个二叉树，返回其按层次遍历的节点值。 （即逐层地，从左到右访问所有节点）。

例如:
给定二叉树: [3,9,20,null,null,15,7],

3
/ \
9 20
/ \
15 7
返回其层次遍历结果：

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

public class LevelOrder {

    @Test
    public void levelOrder() {
        TreeNode treeNode = new TreeNode(3);
        treeNode.left = new TreeNode(9);
        treeNode.right = new TreeNode(20);
        treeNode.right.left = new TreeNode(15);
        treeNode.right.right = new TreeNode(7);
        List<List<Integer>> lists = levelOrder(treeNode);
        Assert.assertArrayEquals(new Integer[]{3}, lists.get(0).toArray());
        Assert.assertArrayEquals(new Integer[]{9,20}, lists.get(1).toArray());
        Assert.assertArrayEquals(new Integer[]{15,7}, lists.get(2).toArray());
    }


    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> arrayLists = new ArrayList<>();

        if (root == null) {
            return new ArrayList<>();
        }

        Queue<TreeNode> queue = new ArrayBlockingQueue<>(100);
        queue.add(root);

        while (queue.size() != 0) {
            ArrayList<Integer> ints = new ArrayList<>();

            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                if (node != null) {
                    ints.add(node.val);
                }
                if (node.left != null) {
                    queue.add(node.left);
                }
                if (node.right != null) {
                    queue.add(node.right);
                }
            }
            arrayLists.add(ints);

        }

        return arrayLists;
    }
}