Given a Binary Tree of N nodes and a positive integer k. The task is to count all distinct nodes that are distance k from a leaf node. Here, k distance from leaf means k levels higher than a leaf node. For example, if k is more than the height of Binary Tree, then nothing should be counted.
Input Format:
The 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 example:
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Output Format:
Count the distinct number of nodes that are at distance k from the leaf nodes.
Your Task:
You don't have to take input. Complete the function printKDistantfromLeaf that takes node and k as parameters and returns the number of nodes that are at distance k from the leaf nodes.
Constraints:
1 <= T <= 30
1 <= N <= 10^{5}
Example:
Input:
2
1 2 3 4 5 6 7 N N N N N 8
2
1 3 N 5 N 7 8 N N 9
4
Output:
2
1
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.
murli01 | 343 |
decoder_101 | 216 |
Sulagna | 189 |
kya_bolti_public | 172 |
madhursengar24 | 172 |
PiyushPandey4 | 717 |
john_wick | 681 |
ASWATHAMA | 565 |
akhyasharma01 | 547 |
jagrit_ | 507 |
blackshadows | 5362 |
Ibrahim Nash | 5242 |
akhayrutdinov | 5111 |
mb1973 | 4929 |
Quandray | 4598 |