In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
A. Insertion
B. Deletion
C. To empty a queue
D. Both Insertion and To empty a queue
Answer:B
In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
A. Insertion B. Deletion C. To empty a queue D. Both Insertion and To empty a queue