Update N-ary Tree Level Order Traversal.java

varunu28 · web-flow · commit b6bed02c8d4f · 2022-09-04T17:03:30.000-07:00
diff --git a/Medium/N-ary Tree Level Order Traversal.java b/Medium/N-ary Tree Level Order Traversal.java
@@ -22,21 +22,19 @@ public List<List<Integer>> levelOrder(Node root) {
     if (root == null) {
       return new ArrayList<>();
     }
-    List<List<Integer>> result = new ArrayList<>();
+    List<List<Integer>> levels = new ArrayList<>();
     Queue<Node> queue = new LinkedList<>();
     queue.add(root);
     while (!queue.isEmpty()) {
       int size = queue.size();
-      List<Integer> level = new ArrayList<>();
+      List<Integer> currLevel = new ArrayList<>();
       while (size-- > 0) {
         Node removed = queue.remove();
-        level.add(removed.val);
-        for (Node child : removed.children) {
-          queue.add(child);
-        }
+        currLevel.add(removed.val);
+        queue.addAll(removed.children);
       }
-      result.add(level);
+      levels.add(currLevel);
     }
-    return result;
-  }
+    return levels;
+  }   
 }
