输入二叉树的先序序列以创建二叉树,并求出该二叉树的高度。
时间: 2024-01-23 22:14:34 浏览: 30
以下是使用先序序列创建二叉树并求出二叉树高度的示例代码:
```python
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
def construct_tree(preorder):
if not preorder:
return None
root_data = preorder.pop(0)
if root_data == '#':
return None
root = Node(root_data)
root.left = construct_tree(preorder)
root.right = construct_tree(preorder)
return root
def get_tree_height(root):
if not root:
return 0
left_height = get_tree_height(root.left)
right_height = get_tree_height(root.right)
return max(left_height, right_height) + 1
preorder = input("请输入二叉树的先序序列(以空格分隔):").split()
root = construct_tree(preorder)
height = get_tree_height(root)
print("该二叉树的高度为:", height)
```