Adding item of nodes, recursively. Linked list

Question

So I am learning about processing linked list. How would I add the items inside the nodes recursively. I could add them by doing sum = h.item +h.next.item+h.next.next.item, but that would only work if i had small linked list. Below is my function addAll with failed attempt.

public class nodeP {

    public static void main(String[] args) {
        node H = new node(9);
        H.next = new node(7);
        H.next.next = new node(5);

         System.out.println(addAll(H));
  }

  static int addAll(node h) {
   int sum = 0;
     if(h.next!=null) {
   sum += h.item + addAll(h.next);
 }
    return sum;
   }
}

note that if you have many numbers, you should consider using a while loop instead, to avoid having too many recursing calls. — Basile Perrenoud
– Basile Perrenoud, Commented Apr 20, 2016 at 8:10

Eran · Accepted Answer · 2016-04-20 08:01:30Z

2

It looks like your code will not add the last node. You have to add h.item to the sum even when h.next is null.

Try :

static int addAll(node h) {
    int sum = h.item;
    if (h.next != null) {
        sum += addAll(h.next);
    }
    return sum;
}

answered Apr 20, 2016 at 8:01

Eran

395k57 gold badges726 silver badges793 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Adding item of nodes, recursively. Linked list

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related