Given a binary tree and an integer X. Your task is to complete the function countSubtreesWithSumX() that returns the count of the number of subtress having total node’s data sum equal to the value X.
Example: For the tree given below:
/ \ / \
9 8 -4 7
Subtree with sum 7:
and one node 7.
First line of input contains the number of test cases T. For each test case, there will be only a single line of input 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
For each test case count the number of subtrees with given sum.
You don't need to read input or print anything. Your task is to complete the function countSubtreesWithSumX() which takes the root node and an integer X as inputs and returns the number of subtrees of the given Binary Tree having sum exactly equal to X.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).
1 <= T <= 100
1 <= N <= 103
-103 <= Node Value <= 103
5 -10 3 9 8 -4 7
1 2 3
Testcase 1: Subtrees with sum 7 are [9, 8, -10] and  (refer the example in the problem description).
Testcase 2: No subtree has sum equal to 5.
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.