Path Sum In Binary Tree

easy
Question Solve Solutions 
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.

Input Format

Input is managed for you.

Output Format

Output is managed for you.

Constraints

0 <= Number of Nodes <= 10^9
-10^9 <= value of Node data <= 10^9

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
7
1
2
-1
-1
3
-1
-1
4
Output
true
Previous
Maximum Path Sum Of Binary Tree
Next
Path Sum In Binary Tree - 2

Related Questions

easy Add One Row To Tree easy Cameras In Binary Tree easy House Robber In Binary Tree easy Longest Zigzag Path In A Binary Tree easy Validate Bst easy Recover Bst easy Construct Binarytree From Preorder And Inorder Traversal medium Construct Binarytree From Postorder And Inorder Traversal easy Construct Bst From Inorder Traversal easy Construct Bst From Preorder Traversal easy Construct Bst From Postorder Traversal medium Construct Bst From Levelorder Traversal easy Serialize And Deserialize Binary Tree easy Construct Binary Tree From Preorder And Postorder Traversal easy Left View Of A Binarytree easy Right View Of A Binarytree