Chapter 3, Problem 12R

Explanation of Solution

Method rotate() in Singly linked list:

//Define the rotate() method

public void rotate()

{

//Check whether the list is empty

if(isEmpty())

  //Return it

  return;

  //Otherwise, execute else statement

else

{

/*Set the next node of "tail" as "head" after existing tail. */

tail.setNext((Node<E>) head);   

}

/*Set the "tail" as "head"*/

tail=(Node<E>)head;

//Set next node of head as "head"

head = head...