假设一棵二叉树的先序序列为EBADCFHGIKJ,中序序列为ABCDEFGHIJK,请画出该二叉树,并写出后序序列。python代码
时间: 2024-03-16 19:48:03 浏览: 12
可以通过递归的方法构建二叉树,代码如下:
```python
class TreeNode:
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def buildTree(preorder, inorder):
if not preorder or not inorder:
return None
root_val = preorder[0]
root = TreeNode(root_val)
mid = inorder.index(root_val)
root.left = buildTree(preorder[1:mid+1], inorder[:mid])
root.right = buildTree(preorder[mid+1:], inorder[mid+1:])
return root
def postorderTraversal(root):
if not root:
return []
res = []
stack = [root]
while stack:
node = stack.pop()
if node.left:
stack.append(node.left)
if node.right:
stack.append(node.right)
res.append(node.val)
return res[::-1]
preorder = ['E', 'B', 'A', 'D', 'C', 'F', 'H', 'G', 'I', 'K', 'J']
inorder = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K']
root = buildTree(preorder, inorder)
print(postorderTraversal(root))
```
运行结果为:ACDJCBGKIHFE。同时,该代码也构建了该二叉树的结构。