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

Adding elements at the end of a singly-linked list can be done in constant time, as we only need to update the "next" pointer of the last node to point to the new node.

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