class TreeNode: def __init__(self, value): self.value = value self.left = None self.right = None def build_tree(preorder, inorder): if not preorder or not inorder: return None root_value = preorder[0] root = TreeNode(root_value) index = inorder.index(root_value) root.left = build_tree(preorder[1:index+1], inorder[:index]) root.right = build_tree(preorder[index+1:], inorder[index+1:]) return root def postorder_traversal(root): if root is None: return [] result = [] result.extend(postorder_traversal(root.left)) result.extend(postorder_traversal(root.right)) result.append(root.value) return result # 示例 preorder = [‘A’, ‘B’, ‘D’, ‘E’, ‘F’, ‘C’] inorder = [‘D’, ‘B’, ‘F’, ‘E’, ‘A’, ‘C’] root = build_tree(preorder, inorder) postorder_result = postorder_traversal(root) print("后序遍历结果:", postorder_result)

27:11