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

In a queue implemented as a singly-linked list, removing an element from the front is a constant time operation, O(1), because it involves updating the head pointer to the next node.

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