如何在Python中找到一棵树(或多个相连的树)上的所有路径？

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

def find_paths(root):
    if not root:
        return []

    paths = []
    dfs(root, [], paths)
    return paths

def dfs(node, path, paths):
    if not node:
        return

    path.append(node.val)

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

    dfs(node.left, path, paths)
    dfs(node.right, path, paths)

    path.pop()

# 创建一棵树
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.left = TreeNode(4)
root.left.right = TreeNode(5)

# 找到树上的所有路径
paths = find_paths(root)
for path in paths:
    print(path)