Q196
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board