Chapter 19, Problem 2AW

Method definition for “reverse()”:

The method definition for “reverse()” is given below:

/* Method definition for "reverse()" */

public void reverse()

{

    //Create a list "rev_list" and set it to "null"

    Node rev_list = null;

/* This loop will perform up to the first node equals to "null" */

    while (first != null)

    {

/* Move a node to rev_list from what leftovers of the original list */

        /* Set a reference "ref" to first node */

        Node ref = first;

        /* Set "first" to next first node */

        first = first.next;

        /* Set next node to "rev_list" */

        ref.next = rev_list;

        /* Set the "rev_list" to reference "ref" */

        rev_list = ref;

    }

    /* Make the list "rev_list" as the new list */

    first = rev_list;

}

Explanation:

From the above method definition,

• Create a list “rev_list” and then set it to “null”.
• Performs “while” loop. This loop will perform up to the first node becomes “null”.
  • Set a reference “ref” to first node.
  • Set “first” to next value of “first”.
  • Assign next node to “rev_list”.
  • Assign the “rev_list” to reference “ref”.
• Finally make the list “rev_list” as new list.

Complete code:

The complete executable code for “reverse()” method is given below:

//Define "LinkedList1" class

class LinkedList1

{

/* The code for this part is same as the textbook of "LinkedList1" class */

/* Method definition for "reverse()"*/

    public void reverse()

    {

        //Create a list "rev_list" and set it to "null"

        Node rev_list = null;

/* This loop will perform up to the first node equals to "null" */

        while (first != null)

        {

/* Move a node to rev_list from what remains of the original list */

/* Set a reference "ref" to first node */

            Node ref = first;

            /* Set "first" to next first node */

            first = first...