Runtime: 112 ms (Top 7.97%) | Memory: 14.4 MB (Top 40.85%)

Author: AnasImloul

scripts/algorithms/L/Lowest Common Ancestor of Deepest Leaves/Lowest Common Ancestor of Deepest Leaves.py

@@ -1,6 +1,7 @@
+# Runtime: 112 ms (Top 7.97%) | Memory: 14.4 MB (Top 40.85%)
 class Solution:
     def lcaDeepestLeaves(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
-        
+
         self.max_lvl = (0,[])
         self.pathes = {}
         def rec(root,parent,lvl):
@@ -16,8 +17,8 @@ def rec(root,parent,lvl):
         rec(root,None,0)
         print(self.max_lvl)
         # for key in self.pathes:
-        #     if key!=None and self.pathes[key]!=None:
-        #         print(key.val,"-",self.pathes[key].val)
+        # if key!=None and self.pathes[key]!=None:
+        # print(key.val,"-",self.pathes[key].val)
         if len(self.max_lvl[1]) < 2:
             return self.max_lvl[1][0]
         parent = self.max_lvl[1]
@@ -27,6 +28,3 @@ def rec(root,parent,lvl):
                 temp.add(self.pathes.get(p,None))
             parent = temp
         return parent.pop()
-            
-            
-