You have implemented a queue as a singly-linked list, adding elements at the end and removing elements at the front.What is the cost of the remove operation? A)O(log(n)) B)O(n) C)O(n²) D)O(1)

Question

Quizplus · Accepted Answer

The remove operation in a singly-linked list can be done in constant time, i.e. O(1), because we only need to modify a few pointers to remove the element from the front of the queue. The other choices are not applicable as they present higher time complexities that are not required for a singly-linked list.

You Have Implemented a Queue as a Singly-Linked List, Adding