输入某二叉树的前序遍历和中序遍历的结构,请重建该二叉树。
假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
二叉树节点的定义如下:
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
递归思想。把构建二叉树的大问题分解成构建左、右子树的两个子问题,即根据前序遍历找出当前结点的根节点,再依据中序遍历来区别出来当前结点的左子树和右子树。
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def __init__(self):
self.post_order_traversal = None
def reconstruct_binary_tree(self, pre, tin):
node = TreeNode(pre[0])
idx = tin.index(pre[0])
if idx > 0:
node.left = self.reconstruct_binary_tree(pre[1:idx+1], tin[:idx])
if idx < len(tin)-1:
node.right = self.reconstruct_binary_tree(pre[idx+1:], tin[idx+1:])
return node
def post_order(self, root):
self.traversal_order(root)
return self.post_order_traversal
def traversal_order(self, root):
if root:
self.traversal_order(root.left)
self.traversal_order(root.right)
if self.post_order_traversal is None:
self.post_order_traversal = []
self.post_order_traversal.append(root.val)
st = Solution()
pre = [1, 2, 4, 7, 3, 5, 6, 8]
tin = [4, 7, 2, 1, 5, 3, 8, 6]
root = st.reconstruct_binary_tree(pre, tin)
print(st.post_order(root))
(最近更新:2019年09月20日)