Complete the following code.
/** Insert an item at the rear of the queue.
Post: item is added to the rear of the queue.
@param item The element to add
@return true (always successful)
*/
Public boolean ____(E item) {
// Check for empty queue.
If (front == null) {
Rear = new Node<E>(item) ;
Front = rear;
} else {
// Allocate a new node at end, store item in it, and
// link it to old end of queue.
Rear.next = new Node<E>(item) ;
Rear = rear.next;
}
Size++;
Return true;
}

Question

Quizplus · Accepted Answer

The method described is adding an item to the rear of the queue, which is what the `offer` method does in queue implementations.

Complete the Following Code