Deletions at Both the Ends

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
a. Input-restricted deque
b. Output-restricted deque
c. Priority queues
d. None of above

Questions by senthilkumar3355

Showing Answers 1 - 12 of 12 Answers

sonia_mehta

  • Jul 6th, 2010
 

Normally, in a queue we insert and delete from one side only but in double ended queue, we can do from both sides. Priority queue is a different concept, in which deletion and insertion are according to priority so, answer is input restricted queue, as input is restricted to 1 side.

Shilpa chavare

  • Sep 12th, 2011
 

your qtn itself has the answer.. wen insertion is restricted to one end, then it obviously has to be input restricted dequeue..:)

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions