如何通过匹配一些值来遍历树和创建遍历路径的路径

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

def find_paths(root, target):
    paths = []
    find_path(root, target, [], paths)
    return paths

def find_path(node, target, path, paths):
    if node is None:
        return

    # 将当前节点加入路径中
    path.append(node.val)

    # 如果当前节点的值等于目标值，并且为叶子节点，则将路径添加到结果中
    if node.val == target and node.left is None and node.right is None:
        paths.append(list(path))

    # 递归遍历左子树和右子树
    find_path(node.left, target - node.val, path, paths)
    find_path(node.right, target - node.val, path, paths)

    # 回溯，将当前节点从路径中移除
    path.pop()