Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution:
- def buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:
- if not inorder or not postorder:
- return None
- val = postorder.pop()
- idx = inorder.index(val)
- root = TreeNode(val)
- root.right = self.buildTree(inorder[idx+1:], postorder)
- root.left = self.buildTree(inorder[:idx], postorder)
- return root
Add Comment
Please, Sign In to add comment