iz Instructions

Question $20$

$0\mathrm{.}25$ pts

In linked list implementation of Queue, if only front pointer is maintained, which of the following operation take worst case linear t$$me$?$

To empty a queue

Deletion

Both to empty a queue and deletion

Insertion