When implementing a queue as a singly-linked list, which of these statements is correct?
A) For better efficiency, nodes should be added at the back and removed at the front.
B) For better efficiency, nodes should be added at the front and removed at the back.
C) There is no difference in efficiency whether nodes are added at the front and removed at the back, or added at the back and removed at the front.
D) You cannot effectively implement a queue as a singly-linked list.

Question

Quizplus · Accepted Answer

In a singly-linked list, adding and removing nodes at the front can be done in constant time O(1), while adding and removing nodes at the back would require traversing the entire list to reach the end, resulting in O(n) time complexity. Therefore, to achieve better efficiency, nodes should be added at the back and removed at the front. This follows the FIFO (First-In-First-Out) principle of a queue.

When Implementing a Queue as a Singly-Linked List, Which of These