# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回构造的TreeNode根节点
def reConstructBinaryTree(self, pre, tin):
# write code here
if len(pre) == 0 or len(tin) == 0:
return None
pRoot = pre[0]
flag = -1
for i in range(0, len(tin)):
if tin[i] == pRoot:
flag = i
break
left = self.reConstructBinaryTree(pre[1: flag+1], tin[:flag])
right = self.reConstructBinaryTree(pre[1+flag: ], tin[flag+1: ])
node = TreeNode(pRoot)
node.left = left
node.right = right
return node
剑指offer 重建二叉树 Python实现
最新推荐文章于 2022-10-20 19:55:29 发布