106. Construct Binary Tree from Inorder and Postorder Traversal【M】【31】

最新推荐文章于 2024-10-12 15:47:31 发布

sscssz

最新推荐文章于 2024-10-12 15:47:31 发布

阅读量344

点赞数

分类专栏： leetcode 算法数据结构二叉树 Python 文章标签：遍历 leetcode leetcode题解树

本文链接：https://blog.csdn.net/sscssz/article/details/51603929

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

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

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

Subscribe to see which companies asked this question

跟前面题一样，不过要注意，后xu遍历，要先处理右边节点，然后再左边节点

class Solution(object):
    def buildTree(self, inorder, postorder):
        i = inorder
        p = postorder
        
        if i:
            val = p.pop()
            pos = i.index(val)
            root = TreeNode(val)
            root.right = self.buildTree(i[pos+1:],p)
            root.left = self.buildTree(i[:pos],p)
            return root