Wilfrid Laurier University

CP 213

package cp213;
/**
* A simple linked queue structure of <code>Node T</code> objects. Only the
* <code>T</code> data contained in the queue is visible through the standard
* queue methods. Extends the <code>SingleLink</code> class, which already
* defines the head node, length, peek, isEmpty, and iterator.
*
* @author your name here
* @author David Brown
* @version 2020-10-16
* @param <T> the SingleQueue data type.
*/
public class SingleQueue<T> extends SingleLink<T> {
// Pointer to the rear of the queue.
private SingleNode<T> rear = null;
/**
* Combines the contents of the left and right SingleQueues into the current
* SingleQueue. Moves nodes only - does not move data or call the high-level
* methods insert or remove. left and right SingleQueues are empty when
done.
* Nodes are moved alternately from left and right to this SingleQueue.
*
* You have two queues called left and right queues. You remove nodes from
these
* two queues to create a new queue (current queue).
*
* If the current queue is empty or not, it should not make a difference to
you.
* you just get nodes from the right and left queues and add them to the
current
* queue. Do not use insert and remove methods. …. Use moveFront method
included
* in the class.
*
* Remember to remove a node from the list you have to update the reference
or
* the pointer that is pointing to the current node.
*
* The getNext() and setNext() meth