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 add operation? A) O(log n) B) O(n) C) O(n²) D) O(1)

Question

Quizplus · Accepted Answer

The cost of the add operation is O(1) because you can maintain a pointer to the end of the singly-linked list, allowing you to add elements directly to the end in constant time.

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