打印n元树python的所有路径

class TreeNode:
    def __init__(self, val, children=None):
        self.val = val
        self.children = children if children else []

def print_paths(root):
    if not root:
        return []
    
    paths = []
    dfs(root, [], paths)
    return paths

def dfs(node, path, paths):
    path.append(node.val)
    
    if not node.children:
        paths.append(path[:])
    else:
        for child in node.children:
            dfs(child, path, paths)
    
    path.pop()

# 示例用法
# 创建一个n元树
root = TreeNode(1, [
    TreeNode(2, [
        TreeNode(5),
        TreeNode(6)
    ]),
    TreeNode(3),
    TreeNode(4, [
        TreeNode(7),
        TreeNode(8)
    ])
])

# 打印所有路径
paths = print_paths(root)
for path in paths:
    print(path)