计算具有给定高度的二叉树中的所有节点

# 定义二叉树节点
class Node:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

# 计算具有给定高度的二叉树中的所有节点
def get_nodes_at_height(root, height):
    if root is None:  # 递归结束条件
        return []

    if height == 1:  # 达到指定高度
        return [root.value]

    nodes = []
    nodes.extend(get_nodes_at_height(root.left, height - 1))
    nodes.extend(get_nodes_at_height(root.right, height - 1))
    return nodes

# 构建一个二叉树
def build_tree():
    root = Node(1)
    root.left = Node(2)
    root.right = Node(3)
    root.left.left = Node(4)
    root.left.right = Node(5)
    root.right.left = Node(6)
    root.right.right = Node(7)
    return root

# 测试计算具有给定高度的二叉树中的所有节点
tree_root = build_tree()
height = 3
nodes_at_height = get_nodes_at_height(tree_root, height)
print(f"高度为 {height} 的二叉树节点：{nodes_at_height}")