层序遍历二叉树

public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) return null;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        Queue<TreeNode> toolQueue = new LinkedList<>();
        while (!queue.isEmpty()) {
            TreeNode node = queue.poll();
            toolQueue.offer(node);
            List<Integer> list = new ArrayList<>();
            if (queue.isEmpty()){
                while (!toolQueue.isEmpty()){
                    TreeNode node1 = toolQueue.poll();
                    list.add(node1.val);
                    if (node1.left != null){
                        queue.offer(node1.left);
                    }
                    if (node1.right != null){
                        queue.offer(node1.right);
                    }
                }
            }
            if (list.size() > 0){
                result.add(list)
            }

        }
        return result;
    }

https://leetcode.com/problems/binary-tree-level-order-traversal/