package cs211.examples;
public class Queue<E> {
/**
* Create a new Queue.
*/
public Queue() {
}
/**
* Add an item to the Queue.
*
* @param item the item to be added to the Queue
*/
public void enqueue(E item) {}
/**
* Remove the oldest item from the Queue and return it.
*
* @return the oldest item from the Queue
* @throws NoSuchElementException if the Queue is empty
*/
public E dequeue() {
return null;
}
/**
* Returns the oldest item in the Queue.
*
* This does not remove the item from the Queue. If there is no item in the
* Queue, this returns null.
*
* @return the oldest item in the Queue or null if the Queue is empty
*/
public E peek() {
return null;
}
/**
* Returns true if the Queue is empty.
*
* @return true if the Queue is empty and false otherwise
*/
public boolean isEmpty() {
return true;
}
}