def root_to_target(root: TreeNode, target: int):path = []def dfs(node):if not node:return Falsepath.append(node.val)if node.val == target:return Trueif dfs(node.left) or dfs(node.right):return Truepath.pop() # backtrackreturn Falseif dfs(root):return pathreturn []