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

Adding nodes at the back and removing them from the front allows both operations to be performed in constant time, O(1), making it efficient for queue operations.

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