how to solve the ques sum at level k as it may have any no of child nodes so how to make o of pointers pointing to child nodes
Sum at level k find no of children
@Namanjain123
Only the input is for a generic tree type. The tree forming would be binary tree only so don’t worry about making more than two child pointers.
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.