In a linked implementation of a queue, what does the add operation do?
A) adds a node to the head
B) adds a node to the tail
C) inserts a node in the middle
D) creates a new instance of the queue

Question

Quizplus · Accepted Answer

In a linked implementation of a queue, the add operation (also known as enqueue) adds a new node to the tail of the linked list. This ensures that the first item added to the queue is also the first item to be removed (FIFO - First In First Out). Adding a node to the head or inserting a node in the middle would violate the order of the queue. Creating a new instance of the queue would not add any nodes to the current queue.

In a Linked Implementation of a Queue, What Does the Add