07: Tree – Sum Levels Java example

Q. Write code to traverse a tree and return the sum of the values (Node.getValue()) of all nodes at the level N in the tree?

package tree;

import java.util.List;

public interface Node<E> {
    E getValue();
    List<Node<E>> getChildren();
}

package tree;

import java.util.List;

public interface Node<E> {

E getValue();

List<Node<E>> getChildren();

}

A. Let’s have a basic implementation of the above Node interface.

package tree;

import java.util.List;

public class NodeImpl<E> implements Node<E> {

    private E value;
    private List<Node<E>> children;

    public NodeImpl(E value, List<Node<E>> children) {
        this.value = value;
        this.children = children;
    }

    public E getValue() {
        return value;
    }

    public List<Node<E>> getChildren() {
        return children;
    }
}

package tree;

import java.util.List;

public class NodeImpl<E> implements Node<E> {

private E value;

private List<Node<E>> children;

public NodeImpl(E value, List<Node<E>> children) {

this.value = value;

this.children = children;

}

public E getValue() {

return value;

}

public List<Node<E>> getChildren() {

return children;

}

Here is…

This content is for 30-Day-Full-Access, 100-Day-Full-Access, 200-Day-Full-Access, and 365-Day-Full-Access members only.

80+ Free Java FAQs

80+ Free Big Data FAQs

Already a member? Log in here

07: Tree – Sum Levels Java example

300+ Java Interview Questions - FAQs

10+ Companion Techs Interview Q&As

300+ Big Data Interview Questions - FAQs

16+ Java Tech Key Areas Interview Q&As

Your Career Tips to go places

Tutorials on Java & Big Data

300+ Java Interview Questions Answered

Disclaimer