Path Sum

Given the root of a binary tree and an integer `targetSum`, return `true` if the tree has a **root-to-leaf path** such that adding up all the values along the path equals `targetSum`. A leaf is a node with no children. ### Constraints - The number of nodes in the tree is in the range `[0, 5000]`. - `-1000 <= Node.val <= 1000` - `-1000 <= targetSum <= 1000` ### Input Format First line contains the integer `targetSum`. Second line contains space-separated integers representing the tree in level-order (-1 for null). ### Output Format Print `true` if a root-to-leaf path sum equals targetSum, otherwise `false`.