DFS:打印所有完整路径

def dfs_print_paths(node, path):
    path.append(node)  # 将当前节点加入路径列表

    if not node.children:  # 如果当前节点是叶子节点
        print_path(path)  # 打印路径列表中的所有节点
        path.pop()  # 移出最后一个节点
        return

    for child in node.children:  # 遍历当前节点的所有子节点
        dfs_print_paths(child, path)  # 递归地遍历子节点

    path.pop()  # 移出当前节点

def print_path(path):
    for node in path:
        print(node.value, end=" ")
    print()

# 示例使用的节点类
class Node:
    def __init__(self, value):
        self.value = value
        self.children = []

# 构建一个示例树
root = Node("A")
node_b = Node("B")
node_c = Node("C")
node_d = Node("D")
node_e = Node("E")
node_f = Node("F")

root.children = [node_b, node_c]
node_b.children = [node_d, node_e]
node_c.children = [node_f]

# 执行DFS打印所有完整路径
dfs_print_paths(root, [])