将他们合起来,变成一个能运行的代码
时间: 2024-02-13 07:05:05 浏览: 24
好的,以下是结合起来的代码:
```python
class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
def preorder_traversal(root):
if root is None:
return
print(root.val)
preorder_traversal(root.left)
preorder_traversal(root.right)
def height(root):
if root is None:
return 0
return max(height(root.left), height(root.right)) + 1
# 创建一颗二叉树
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.left = TreeNode(4)
root.left.right = TreeNode(5)
# 先序遍历该二叉树
print("先序遍历结果:")
preorder_traversal(root)
# 计算二叉树的高度
print("二叉树的高度为:", height(root))
```
输出结果为:
```
先序遍历结果:
1
2
4
5
3
二叉树的高度为: 3
```