Chapter 5, Problem 25C

Explanation of Solution

Recursive method to reverse the singly linked list:

Create the method reverseNode() that accepts the input parameter of “Node” as “head” to reverse the singly linked list by calling this method recursively.

//Define the reverse() method

Node reverseNode(Node head)

{

/*Check whether "head" is null or next of "head" is null.*/

if ( (head==null) || (head.next == null) )

  //Return the head

  return head;

/*Reverse the sub list leaving the head node by calling the reverseNode() method by passing the "head.next". */

  Node reverseOrder = reverseNode(head.next);

//Assign the head as end of the node

  head.next.next = head;

  //Assign last node as "null"

  head...