Chapter 3, Problem 11C

Explanation of Solution

Algorithm:

For reference, the below node can be considered.

class Node

{

int data;

Node next;

};

Step 1: The user need to initialize three-pointers, “prev” as NULL, “curr” as head and “next” as NULL.

Step 2: Iterate the linked list and do the following:

//define the method reverse

Node reverse(Node node)

{

//initialised prev to null

Node prev = null;

// initialised current to node ,where node is the starting node of the linked list

Node current = node

//initialised next to null.

Node next = null;

//iterate a while loop

while (current != null)

{

// set the nodes

next = current.next; 

current...