class Solution: def FindPath(self, root: TreeNode, target: int) -> List[List[int]]: def dfs(root, target,tmp): if not root: return [] if root.left: dfs(root.left, target-root.val, tmp+[root.val]) if root.right: ...