chandansgowda
diff --git a/‎001-500/106.py
Copy file name to clipboard
+15Lines changed: 15 additions & 0 deletions b/‎001-500/106.py
Copy file name to clipboard
+15Lines changed: 15 additions & 0 deletions
@@ -0,0 +1,15 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def buildTree(self, inorder: List[int], postorder: List[int]) -> Optional[TreeNode]:
+        if not inorder:
+            return None
+        root = TreeNode(postorder.pop())
+        mid = inorder.index(root.val)
+        root.left = self.buildTree(inorder[:mid], postorder[:mid])
+        root.right = self.buildTree(inorder[mid+1:], postorder[mid:])
+        return root