In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
(c) To empty a queue
(d) Both Insertion and To empty a queue
My question is taken from Queue using Linked List topic in portion Abstract Data Types of Data Structures & Algorithms I
I got this question during an interview for a job.