"```python class TreeNode: def __init__(self, value=0, children=None): self.value = value self.children = children if children is not None else [] def generate_tree(depth, breadth, start_value=0): if depth == 0: return None root_value = start_value root = TreeNode(root_value) next_value = start_value + 1 for _ in range(breadth): child_tree = generate_tree(depth - 1, breadth, next_value) if child_tree: root.children.append(child_tree) next_value += breadth return root def print_tree(node, level=0): if node is not None: print(' ' * level * 2 + str(node.value)) for child in node.children: print_tree(child, level + 1) # Example usage: tree = generate_tree(3, 2, 1) print_tree(tree) ``` 这段代码定义了一个简单的树结构，并通过`generate_tree`函数递归地生成树。树的深度由`depth`参数指定，每层的节点数由`breadth`参数指定，节点的起始值由`start_value`指定。`print_tree`函数用于打印生成的树结构。"