Chapter 3, Problem 10R

Explanation of Solution

Method size() in Circularly linked list:

//Define the size() method

public int size()

{

  //Check whether the "tail" is equal to "null"

if (tail == null)

  //Return the value "0"

  return 0;

  //Create a node to hold the head value

Node<E> node = tail−>next;

  //Declare and initialize a variable

int counter=1;

/* Loop executes until the "node" is not equal to "tail"*/

while (node != tail)

{

  //Increment "counter" variable by "1"

  counter++;

/* Next node is determined by getNext() and assigned to "node" variable*/

  node = node...