Computer Science, asked by Shivamrajput7506, 7 months ago

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 reeshasingh12

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.

Previous Question

Next Question

Similar questions

Math, 4 months ago

prove that (2a, 4a), 2a,6a), (2a+a root3, 5a) are the vertices of an equilateral triangle.

English, 4 months ago

Change the following into indirect speech (l) The boy said, "I do my homework regularly". (ll)I said to the visitor "where do you come from?" (III) The teacher said, "Work hard and regularly".

Math, 4 months ago

solve this question...

Physics, 7 months ago

Name the energy possessed by motion of particles of matter...

Geography, 7 months ago

Desert plants are usually.

Business Studies, 10 months ago

Accounting for partnership firms fundamentals in 2 solution...

Political Science, 10 months ago

Act which redesignated the governor general of bengal to governor general of india...

Geography, 10 months ago

According to population which is the smallest state in india...