In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
Answers
Answered by
4
Answer:
In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time? Explanation: Since front pointer is used for deletion, so worst time for the other two cases.
Similar questions