Python:获取树中所有可能路径的列表？

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

def get_all_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[:])
    else:
        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)

# 获取所有可能路径的列表
all_paths = get_all_paths(root)
print(all_paths)

[[1, 2, 4], [1, 2, 5], [1, 3]]