jinhuang1102

106. Construct Binary Tree from Inorder and Postorder Traver

May 5th, 2019
145
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.42 KB | None | 0 0
  1. class Solution:
  2.     def buildTree(self, inorder: List[int], postorder: List[int]) -> TreeNode:
  3.         if not inorder or not postorder:
  4.             return None
  5.        
  6.         val = postorder.pop()
  7.         idx = inorder.index(val)
  8.        
  9.         root = TreeNode(val)
  10.         root.right = self.buildTree(inorder[idx+1:], postorder)
  11.         root.left = self.buildTree(inorder[:idx], postorder)
  12.        
  13.         return root
Add Comment
Please, Sign In to add comment