Construct Binary Tree from Inorder and Postorder Traversal

思路和依据前序遍历和中序遍历重建树的思路一样,复杂度也一致,代码如下:

class Solution(object):
    def buildTree(self, inorder, postorder):
        """
        :type inorder: List[int]
        :type postorder: List[int]
        :rtype: TreeNode
        """
        if not inorder:
            return None
        length = len(inorder)
        map = {}
        for i in xrange(length):
            map[inorder[i]] = i
        return self.helper(postorder,0,length-1,0,length-1,map)
            
    def helper(self,postorder,Istart,Iend,Pstart,Pend,map):
        if Istart > Iend:
            return None
        node = TreeNode(postorder[Pend])
        if Istart == Iend:
            return node
        index = map[node.val]
        node.left = self.helper(postorder,Istart,index-1, Pstart,Pstart+index-Istart-1,map)
        node.right = self.helper(postorder,index+1,Iend,Pstart+index-Istart,Pend-1,map)
        return node

 

转载于:https://www.cnblogs.com/sherylwang/p/5405724.html

已标记关键词 清除标记
表情包
插入表情
评论将由博主筛选后显示,对所有人可见 | 还能输入1000个字符
相关推荐
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客 返回首页