Runtime: 47 ms (Top 88.16%) | Memory: 16.3 MB (Top 23.73%)

Author: AnasImloul

scripts/algorithms/M/Maximum Depth of Binary Tree/Maximum Depth of Binary Tree.py

@@ -1,3 +1,4 @@
+# Runtime: 47 ms (Top 88.16%) | Memory: 16.3 MB (Top 23.73%)
 class Solution(object):
     def maxDepth(self, root):
         """
@@ -8,11 +9,11 @@ def maxDepth(self, root):
         depths = []
         self.handler(root, result, depths)
         return max(depths)
-    
+
     def handler(self, root, result, depths):
         if root:
             result += 1
             self.handler(root.left, result, depths)
             self.handler(root.right, result, depths)
         else:
-            depths.append(result)
+            depths.append(result)