Question

(C++) compute and return the sum of the ints contained in the Array table using RECURSION. Start with the following function.

int sum(node * head[]);   

//

//

//This is the provided header file.

//arr.h
#include
#include
#include

const int SIZE = 5;   //size of the array of head pointers

struct node
{
int data;
node * next;
};

/* These functions are already written and can be called to test out your code */
void build(node * head[]); //supplied
void display(node * head[]); //supplied
void destroy(node * head[]); //supplied

/* *****************YOUR TURN! ******************************** */
//Write your function prototype here:

int sum(node * head[]);   

Answer 1

int sumNode(node *head){
    if(head == NULL){
        return 0;
    }
    else{
        return head->data + sumNode(head->next);
    }
}

int sum(node * head[]){
    int s = 0;
    for(int i = 0;i<5;i++){
        s += sumNode(head[i]);
    }
    return s;
}