Root To Leaf Path Sum

You are given the root of a **binary tree** and an integer **targetSum**. Your task is to determine whether there exists a **root-to-leaf path** such that the sum of the node values along the path equals **targetSum**. A **root-to-leaf path** is a path that: - Starts from the **root node**. - Ends at a **leaf node** (a node with no children). - Includes every node along the path exactly once. Return **`true`** if such a path exists; otherwise, return **`false`**.

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.