Double Ended Queue

• Double Ended Queue is also a Queue data structure.
• This queue is also Linear data structure.
• It has two ends:
• 1. Left end
• 2. Right end.
• Insertion and deletion operations are performed at both the ends.
• We can insert at both front and rear positions and
  
  can delete from both front and rear positions.
• Therefore we need to restrict anyone operations.
• So, it has mainly two types:


• 1. Input restricted double-ended queue.
• The insertion operation is performed at only one end and deletion operation is performed at both the ends.
• 2. Output restricted double-ended queue.
• The deletion operation is performed at only one end and insertion operation is performed at both the ends.

Operations on Double Ended Queue:
Insertion

Deletion