Trees -- Find sum at level K Java

justformyntra8 · May 31, 2019, 4:55pm

I have written the complete code to make the tree, along with printing the sum,
However, I am only able to take input as a continuous line of numbers, and not in the format specified in the question.
So, please tell me how do I take the input as specified by the question.
My code is:

github.com

bhardwaj-aman/java-data-structures-practice-questions/blob/master/sumAtLevelK.java

package treepractice;

import java.util.*;
public class sumAtLevelK {
    public static void main(String args[]) {
        tree t = new tree();
        Scanner scan = new Scanner(System.in);
        int k = scan.nextInt();
        System.out.println(t.sumK(k,t.root,0,0));
    }

}
class tree{
    public class node {
        int data;
        ArrayList<node> children;

        node(int d) {
            this.data = d;
            this.children = new ArrayList<node>();

This file has been truncated. show original

Jaa18Crx0002 · June 2, 2019, 2:47pm

Hi Aman,
You don’t have to use print statements while taking input.

Riyabansal98 · June 6, 2019, 6:03am

Hi Aman

As you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.

Riyabansal98 · June 6, 2019, 6:03am

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.