Runtime: 12 ms (Top 70.59%) | Memory: 17.4 MB (Top 21.88%)

Author: AnasImloul

scripts/algorithms/M/Maximum Width of Binary Tree/Maximum Width of Binary Tree.cpp

@@ -1,11 +1,12 @@
+// Runtime: 12 ms (Top 70.59%) | Memory: 17.4 MB (Top 21.88%)
 /*
 Run BFS and store the index of the node when it was stored in the flattened manner.
 Take the diff of each of the level and keep traking of max value
 
  */
 class Solution {
 public:
-    
+
     int widthOfBinaryTree(TreeNode* root) {
         if(!root) return 0;
         int res = 0;
@@ -25,4 +26,4 @@ class Solution {
         }
         return res;
     }
-};
+};