A linked implementation of a queue is facilitated by references to the ______ and ______ elements of the linked list.
A) First, second
B) First, middle
C) Middle, last
D) First, last

Question

Quizplus · Accepted Answer

In a linked implementation of a queue, references to the first and last elements of the linked list are essential for efficient enqueue (addition) and dequeue (removal) operations. The first element (head) is where dequeue operations occur, and the last element (tail) is where enqueue operations occur.

A Linked Implementation of a Queue Is Facilitated by References