In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
Admin Staff asked 5 years ago
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