#106

Author: Parth Shah

106_Construct Binary_Tree_from_Inorder_and_Postorder_Traversal.py

@@ -0,0 +1,16 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:
+        if not inorder:
+            return None
+        root = TreeNode(postorder[-1])
+        rootpos = inorder.index(postorder[-1])
+        root.left = self.buildTree(inorder[:rootpos],postorder[:rootpos])
+        root.right = self.buildTree(inorder[rootpos+1:],postorder[rootpos:-1])
+        return root