Chapter 3, Problem 7C

Explanation of Solution

Algorithm:

void recursiveReverse(struct Node** head_ref)

{

struct Node* first;

struct Node* rest;

// if head is null then return

if (*head_ref == NULL)

    return;

// this is the first element of the linked list

first = *head_ref;

// this is remaining list

rest = first->next;

// if list has one element then return

if (rest == NULL)

    return;  

recursiveReverse(&rest);

first->next->next = first; 

// as we are reversing the list make its next element null

first-...