import java.util.NoSuchElementException;

/** The K_LLQueue class implements the <code>K_Queue</code> interface (a
 *  simple version of a Queue abstract data structure) using a linked list
 *  data structure internally.
 *
 *  According to the interface, the basic <code>enqueue</code> and
 *  <code>dequeue</code> operations act as follows:
 *  <ul>
 *    <li>The enqueue method adds an element to the "back" of the
 *        data structure.
 *    <li>The dequeue method acts as follows:
 *        <ul>
 *        <li>If the queue is empty, an exception is thrown.
 *        <li>If the queue contains one element, dequeue returns that element,
 *          leaving the queue empty.
 *        <li>If the queue contains multiple elements, dequeue returns the
 *          element at the "front" of the queue, the one that has been there
 *          longest.  (FIFO - First In, First Out)
 *        </ul>
 *  </ul>
 *
 *  @author Your Name
 *  @version The Date
 **/

public class K_LLQueue<T> implements K_Queue<T>
{
  // Instance variable: Define an internal Linked List.

  // Constructor

  // Implement methods from the K_Queue interface.

    /** {@inheritDoc}
     **/
    @Override
    public boolean isEmpty()
    {
        return true;     // temporary stub
    }
 
    /** {@inheritDoc}
     **/
    @Override
    public int size()
    {
        return 0;        // temporary stub
    }

    /** {@inheritDoc}
     **/
    @Override
    public void enqueue(T item)
    {
    }

    /** {@inheritDoc}
     **/
    @Override
    public T dequeue() throws NoSuchElementException
    {
        return null;     // temporary stub
    }

    /** {@inheritDoc}
     **/
    @Override
    public T peekNext() throws NoSuchElementException
    {
        return null;     // temporary stub
    }
}