Runtime: 110 ms (Top 30.61%) | Memory: 44.3 MB (Top 44.87%)

Author: AnasImloul

scripts/algorithms/B/Binary Tree Level Order Traversal II/Binary Tree Level Order Traversal II.js

@@ -1,8 +1,9 @@
+// Runtime: 110 ms (Top 30.61%) | Memory: 44.3 MB (Top 44.87%)
 var levelOrderBottom = function(root) {
     let solution = []
     function dfs(node, level) {
         if(!node) return null
-    
+
         if(!solution[level]) solution[level] = []
         solution[level].push(node.val)
 
@@ -11,4 +12,4 @@ var levelOrderBottom = function(root) {
     }
     dfs(root, 0)
     return solution.reverse()
-};
+};