class LinkQueue {
  private DoubleEndedLinkedList theList;

  public LinkQueue() {               // constructor
    theList = new FirstLastList();   // make a nelist
  }
  
  public boolean isEmpty() {         // true if queue is empty
    return theList.isEmpty();
  }

  public void insert(int i) {        // insert, rear of queue
    theList.insertLast(j);
  }

  public int remove() {              // remove, front of queue
    return theList.deleteFirst();
  }
  
  public void displayQueue() {
      System.out.print("Queue (front-->rear): ");
      theList.displayList();
  }
} // end LinkQueue