递归方法调用Python BST height实现

class Node:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

def insert(root, value):
    if root is None:
        return Node(value)
    if value < root.value:
        root.left = insert(root.left, value)
    else:
        root.right = insert(root.right, value)
    return root

def height(root):
    if root is None:
        return 0
    left_height = height(root.left)
    right_height = height(root.right)
    return max(left_height, right_height) + 1

# 构建BST
root = None
values = [5, 3, 8, 2, 4, 7, 9]
for value in values:
    root = insert(root, value)

# 计算BST的高度
tree_height = height(root)
print("BST的高度为:", tree_height)