如何跟踪树状数据结构的所有路径？

# 定义树节点类
class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []

# 递归函数，用于遍历树的所有路径
def find_all_paths(node, path, paths):
    # 将当前节点添加到路径中
    path.append(node.value)

    # 如果当前节点没有子节点，说明到达了叶子节点，将路径添加到结果中
    if len(node.children) == 0:
        paths.append(path[:])
    else:
        # 递归遍历所有子节点
        for child in node.children:
            find_all_paths(child, path, paths)

    # 回溯，将当前节点从路径中移除
    path.pop()

# 创建一个树状数据结构的示例
root = TreeNode(1)
node2 = TreeNode(2)
node3 = TreeNode(3)
node4 = TreeNode(4)
node5 = TreeNode(5)
node6 = TreeNode(6)

root.children = [node2, node3]
node2.children = [node4, node5]
node3.children = [node6]

# 调用递归函数查找所有路径
paths = []
find_all_paths(root, [], paths)

# 打印结果
for path in paths:
    print(path)