src/main/java/com/fishercoder/solutions/_429.java

package com.fishercoder.solutions;

import com.fishercoder.common.classes.Node;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

public class _429 {
    public static class Solution1 {
        public List<List<Integer>> levelOrder(Node root) {
            List<List<Integer>> result = new ArrayList<>();
            if (root == null) {
                return result;
            }
            Queue<Node> queue = new LinkedList<>();
            queue.offer(root);
            while (!queue.isEmpty()) {
                int size = queue.size();
                List<Integer> level = new ArrayList<>();
                for (int i = 0; i < size; i++) {
                    Node currentNode = queue.poll();
                    if (currentNode != null) {
                        level.add(currentNode.val);
                        for (Node child : currentNode.children) {
                            queue.offer(child);
                        }
                    }
                }
                result.add(level);
            }
            return result;
        }
    }
}