106 中后序构造二叉树

二叉树

中序和后序 利用后序pop和递归

# 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]) -> TreeNode:
        def biuld_tree(left_index,right_index):
            if left_index>right_index:
                return None
            val = postorder.pop()
            root = TreeNode(val)
            index = index_map[val]
            root.right = biuld_tree(index+1,right_index)
            root.left = biuld_tree(left_index,index-1)
            return root
        lenth = len(inorder)
        index_map = {val:idx for idx,val in enumerate(inorder)}
        return biuld_tree(0,lenth-1)

return None