Runtime: 274 ms (Top 36.07%) | Memory: 88.6 MB (Top 22.22%)

Author: AnasImloul

scripts/algorithms/C/Construct Binary Tree from Preorder and Inorder Traversal/Construct Binary Tree from Preorder and Inorder Traversal.py

@@ -1,9 +1,11 @@
+# Runtime: 274 ms (Top 36.07%) | Memory: 88.6 MB (Top 22.22%)
+
 # Definition for a binary tree node.
 # class TreeNode(object):
-#     def __init__(self, val=0, left=None, right=None):
-#         self.val = val
-#         self.left = left
-#         self.right = right
+# def __init__(self, val=0, left=None, right=None):
+# self.val = val
+# self.left = left
+# self.right = right
 class Solution(object):
     def buildTree(self, preorder, inorder):
         """
@@ -13,9 +15,9 @@ def buildTree(self, preorder, inorder):
         """
         if not preorder or not inorder:
             return None
-        
+
         root = TreeNode(preorder[0])
         mid = inorder.index(preorder[0])
         root.left = self.buildTree(preorder[1:mid+1], inorder[:mid])
         root.right = self.buildTree(preorder[mid+1:], inorder[mid+1:])
-        return root
+        return root