1def has_path_sum(root, targetSum):
2 def dfs(node, curr_sum):
3 if not node:
4 return False
5 curr_sum += node.val
6 if not node.left and not node.right:
7 return curr_sum == targetSum
8 return dfs(node.left, curr_sum) or dfs(node.right, curr_sum)
9
10 return dfs(root, 0)