Question

how can I find the sum of data that are in the list using an ARRAY of linked list . I just need a small example please. I'm not sure how to move from head[0] to head[1]....???

// This is the struct that I am working on:

struct node

{

int data;

node * next;

}

class List

{

public:

list();

~list();

private:

node ** head;

int size;

};

Answer 1

int sum() {
    int s = 0;

    // move one by one on all the indices of array
    // which means one by one take a horizontal linked list
    for(int i=0; i<size; i++) {
        // find the sum of list at index i
        node *start = head[i];

        while(start != NULL) {
            s += start->data;
            start = start->next; // move to next node in list
        }
    }
    return s;
}