FIND SUM AT LEVEL K - Doubt

[Bumblebee (Himalaya Sharma)]

I am having a hard time understanding the inputs given to generate trees. Please tell me how the tree would look like in the given testcase. Also how do you know that the tree has to be constructed in that way.

[gaurav13998 (Gaurav Bhatt)]

hey @Bumblebee, yes this testcase is difficult to understand. I suggest you to go through this thread. Complete question is expalined here very well

FIND SUM AT LEVEL K Take input of a generic tree using buildtree() function and also take input K the level at which we need to find the sum

Hi Aman , This particular problem asks you to take a generic tree input . A generic tree is a tree where any node can have any number of children (unlike binary trees where a node can have atmost 2 children). The first integer in each row indicates the data at the node whereas the second integer indicates the no of children that node has . Refer to this code for the input function - https://ide.codingblocks.com/s/90995 As for the sample testcase given in the problem 1 2 2 2 3 0 4 0 5 2 …

[Bumblebee (Himalaya Sharma)]

Thanks for the link.

[gaurav13998 (Gaurav Bhatt)]

hey @Bumblebee , if your query is resolved. Please mark this doubt as resolved and rate me on the basis of your experience.
rating option will appear when to mark this doubt as resolved