BETA

Difficulty Level:

Medium

Total Submissions: 1928 Accuracy:

23.39%

K-Sum Paths (Function Problem)
     

A binary tree and a number k are given. Print the count of every path in the tree with sum of the nodes in the path as k.

Input:
First line consists of T test cases. First line of every test case consists of N, denoting the number of Node is Binary tree. Second line consists of N spaced 3 elements denoting the Parent node, Child Node and a character denoting left or right child. Third line of every test case consists of a integer K.

Output:
Return the Count of number of paths in tree.

Constraints:
1<=T<=20
1<=N<=100

Example:
Input:

1
4
1 3 L 3 2 L 3 -1 R -1 1 R
4
Output:
2

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.