Given a Binary Tree and a sum s, your task is to check whether there is a root to leaf path in that tree with the following sum . You are required to complete the function hasPathSum. You should not read any input from stdin/console. There are multiple test cases. For each test case, this method will be called individually.
First line of input contains the number of test cases T. For each test case, there will be two lines of input first of which is a string representing the tree as described below:
The values in the string are in the order of level order traversal of the tree where, numbers denotes node values, and a character “N” denotes NULL child.
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Second line contains an integer s.
There are multiple test cases. For each test case, this method will be called individually.
The function should return the true if such path exist else return false.
You don't need to take input. Just complete the function hasPathSum() which accepts root node of the tree and target sum as a parameter and return a boolean value according to if we can get the sum or not.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).
1 <=T<= 100
1 <=Number of nodes<= 10000
1 <=Data of a node<= 1000
1 <= Sum <= 106
1 2 3
1 2 3
In above example there are two test case where each represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 2 and right child of 1 is 3.
Note: The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.