How to take input

#1

i am unable to understand the way level order traversal input is proided

#2

@rdsaurabh97
you have the root of the tree at first.then u are given the no of children it has.
then we move to its left child .see the no of children it got then access the left root and go further till there are no more then access the right root doing the same for it. then we move to the right child of the root and follow the same for that part .then we take in k ,the level at which we need the sum.

#3

please mark your doubt as resolved,if u are satisfied with my solution