In which data structure, elements can be added or
removed at either end, but not in the middle?

• Deque(Double ended queue)
• 11 years agoHelpfull: Yes(30) No(3)
• circular queue
• 11 years agoHelpfull: Yes(5) No(9)
• doubly linked list
  
• 10 years agoHelpfull: Yes(3) No(7)
• Deque!-DOUBLE ENDED QUEUE
• 10 years agoHelpfull: Yes(3) No(0)
• Deque.In this insertion as well as deletion at both end is allowed
• 10 years agoHelpfull: Yes(2) No(0)
• Double Ended Queue
• 10 years agoHelpfull: Yes(1) No(0)
• double ended queue
• 9 years agoHelpfull: Yes(1) No(0)
• in link list
• 10 years agoHelpfull: Yes(0) No(7)
• queue....since queue follows first in first out
• 10 years agoHelpfull: Yes(0) No(1)
• circular queue
• 10 years agoHelpfull: Yes(0) No(1)
• deque.........................
• 9 years agoHelpfull: Yes(0) No(0)
• deque is the answer i.e. double ended queue is the data structure where elements can be added or removed from either end.
• 7 years agoHelpfull: Yes(0) No(0)
• Deque or Double ended queue .
• 6 years agoHelpfull: Yes(0) No(0)