array-based implementation is quite efficient implementing queue with generic linked list we can efficiently implement the queue adt using generic singly linked list for efficiency reasonswe choose the front of the queue to be at the head of the listand the rear of the queue to be at the tail of the list in this waywe remove from the head and insert at the tail (why would it be bad to insert at the head and remove at the tail?note that we need to maintain references to both the head and tail nodes of the list rather than go into every detail of this implementationwe simply give java implementation for the fundamental queue methods in code fragment code fragment methods enqueue and dequeue in the implementation of the queue adt by means of singly linked listusing nodes from class node of code fragment