从语言写出实现输出二叉树中从每个叶子结点到根结点的路径的伪代码

以下是输出二叉树中从每个叶子结点到根结点的路径的伪代码：

function printPaths(root, path):
    if root is None:
        return

    # append current node to the path
    path.append(root.value)

    # print paths from leaf node to root if node is a leaf
    if root.left is None and root.right is None:
        printPath(path)

    # traverse left and right subtree
    printPaths(root.left, path)
    printPaths(root.right, path)

    # remove current node from the path
    path.pop()

function printPath(path):
    for val in path:
        print(val, end=' ')
    print()

注意：这是伪代码，需要根据具体情况进行修改才能使用。