如何打印二叉树的所有可能的路径，假设我已经将所有直接连接的节点作为字典中的列表？

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

def print_all_paths(root):
    result = []

    def dfs(node, path):
        path.append(node.val)

        if not node.left and not node.right:
            result.append(path[:])

        if node.left:
            dfs(node.left, path)

        if node.right:
            dfs(node.right, path)

        path.pop()

    dfs(root, [])
    return result