Runtime: 2 ms (Top 39.54%) | Memory: 43.4 MB (Top 69.45%)

Author: AnasImloul

scripts/algorithms/B/Binary Tree Level Order Traversal/Binary Tree Level Order Traversal.java

@@ -1,3 +1,4 @@
+// Runtime: 2 ms (Top 39.54%) | Memory: 43.4 MB (Top 69.45%)
 class Solution {
     public List<List<Integer>> levelOrder(TreeNode root) {
         List<List<Integer>> result = new ArrayList<>();
@@ -8,9 +9,9 @@ public List<List<Integer>> levelOrder(TreeNode root) {
         result.add(rootList);
         levelOrder(root,1,result);
         return result;
-        
+
     }
-    
+
     private void levelOrder(TreeNode root, int level, List<List<Integer>> result) {
         if(root == null)
             return;
@@ -24,7 +25,7 @@ private void levelOrder(TreeNode root, int level, List<List<Integer>> result) {
         levelOrder(root.left, level + 1, result);
         levelOrder(root.right, level + 1,result);
     }
-    
+
     private List<Integer> exploreChildren(TreeNode root) {
         List<Integer> children = new ArrayList<>();
         if(root.left != null)
@@ -34,4 +35,3 @@ private List<Integer> exploreChildren(TreeNode root) {
         return children;
     }
 }
-