Path Sum In Binary Tree
1. You are given a partially written function to solve. 2. You are required to complete the body of hasPathSum function. The function is expected to return boolean value depending upon root-to-leaf paths where path sum equals targetSum. 3. Input and Output is managed for you.
0 <= Number of Nodes <= 10^9 -10^9 <= value of Node data <= 10^9
Input is managed for you.
Output is managed for you.
7 1 2 -1 -1 3 -1 -1 4