Runtime: 178 ms (Top 20.74%) | Memory: 14.8 MB (Top 52.51%)

Author: AnasImloul

scripts/algorithms/R/Recover a Tree From Preorder Traversal/Recover a Tree From Preorder Traversal.py

@@ -1,3 +1,5 @@
+# Runtime: 178 ms (Top 20.74%) | Memory: 14.8 MB (Top 52.51%)
+
 class Solution:
     def recoverFromPreorder(self, traversal: str) -> Optional[TreeNode]:
         i = 0
@@ -7,10 +9,10 @@ def recoverFromPreorder(self, traversal: str) -> Optional[TreeNode]:
             if traversal[i].isdigit():
                 value, i = get_value(traversal, i)
                 insert_node(dummy_head, depth, value)
-            
+
             else:
                 depth, i = get_depth(traversal, i)
-                
+
         return dummy_head.left
 
 # Returns the next value from the string traversal, and returns the position following the last digit of the current value.
@@ -20,7 +22,7 @@ def get_value(traversal, i):
         value *= 10
         value += int(traversal[i])
         i += 1
-    
+
     return value, i
 
 # Insertes a node of the given `value` at the given `depth` of the subtree whose root is the given `root`.
@@ -30,18 +32,18 @@ def insert_node(root, depth, value):
             root = root.right
         else:
             root = root.left
-    
+
     new_node = TreeNode(value)
     if root.left:
         root.right = new_node
     else:
         root.left = new_node
-    
+
 # Gets the next depth from the string traversal, and returns the position following the last dash of the current depth.
 def get_depth(traversal, i):
     depth = 0
     while i < len(traversal) and traversal[i] == "-":
         depth += 1
         i += 1
-    
-    return depth, i
+
+    return depth, i