[Leetcode]Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2021-11-20 22:20:24 发布

NoooName

最新推荐文章于 2021-11-20 22:20:24 发布

阅读量307

点赞数

分类专栏： DFS Tree 文章标签： leetcode python

本文链接：https://blog.csdn.net/NoooName/article/details/42848253

版权

Tree 同时被 2 个专栏收录

22 篇文章 0 订阅

订阅专栏

DFS

10 篇文章 0 订阅

订阅专栏

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:

You may assume that duplicates do not exist in the tree.

跟上一道类似，根据前序遍历和中序遍历重新构造出二叉树~解法也是基本上一样得，代码如下~

class Solution:
    # @param preorder, a list of integers
    # @param inorder, a list of integers
    # @return a tree node
    def buildTree(self, preorder, inorder):
        if preorder is None or inorder is None or len(preorder) == 0 or len(inorder) == 0: return None
        dict = {}
        for i in xrange(len(inorder)):
            dict[inorder[i]] = i
        return self.helper(preorder, inorder, dict, 0, len(preorder) - 1, 0, len(inorder) - 1)
        
    def helper(self, preorder, inorder, dict, preL, preR, inL, inR):
        if preL > preR or inL > inR: return None
        root = TreeNode(preorder[preL])
        index = dict[preorder[preL]]
        root.left = self.helper(preorder, inorder, dict, preL + 1, preL + index - inL, inL, index - 1)
        root.right = self.helper(preorder, inorder, dict, preL + index - inL + 1, preR, index + 1, inR)
        return root