convert n-tree to dictionary based on depth

public Map<Integer, List<Integer>> toDict() {
          
            Map<Integer, List<Integer>> dict = new HashMap<>();
            Queue<Node> queue = new LinkedList<>();
            queue.add(root);
            int depth = 0;

            while (!queue.isEmpty()) {
                int levelSize = queue.size();
                List<Integer> currentLevel = new ArrayList<>();

                for (int i = 0; i < levelSize; i++) {
                    Node node = queue.poll();
                    currentLevel.add(node.getValue());

                    // Add all children of the current node to the queue
                    for (Node child : node.children) {
                        queue.add(child);
                    }
                }
                dict.put(depth, currentLevel);
                depth++;
            }
            return dict;
        }

public Map<Integer, List<Integer>> toDict() {
          
            Map<Integer, List<Integer>> dict = new HashMap<>();
            Queue<Node> queue = new LinkedList<>();
            queue.add(root);
            int depth = 0;

            while (!queue.isEmpty()) {
                int levelSize = queue.size();
                List<Integer> currentLevel = new ArrayList<>();

                for (int i = 0; i < levelSize; i++) {
                    Node node = queue.poll();
                    currentLevel.add(node.getValue());

                    // Add all children of the current node to the queue
                    for (Node child : node.children) {
                        queue.add(child);
                    }
                }
                dict.put(depth, currentLevel);
                depth++;
            }
            return dict;
        }