In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time? - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
19 Mar 2019 11:39 AM study24x7 study24x7

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

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles