Trees-find sum at k level

#1

Could please help me in comprehending the question properly as I am not able to comprehend the Sample Input given or mentioned here in the Problem Statement.

#2

you are required to build a generic tree, whose first value denotes the node and 2nd value tells the no of children the particular node has.(tree is build using recursion)

#3

As for the sample testcase given in the problem
1 2
2 2
3 0
4 0
5 2
6 0
7 0
2

Here the tree looks like

                 1                                 Level 0
            /          \
          2              5                         Level 1
       /      \       /     \
      3       4      6        7                    Level 2

Sum at Level 2 = 3 + 4 + 6 + 7 = 20

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.