what is dequeue in data structure?
<answer> It is a data structure in which elements may be added to or deleted from the front or the rear. <context> DeQueue (or) Deque (Double ended Queue) :-. DeQueue is a data structure in which elements may be added to or deleted from the front or the rear. Like an ordinary queue, a double-ended queue is a data structure it supports the following operations: enq_front, enq_back, deq_front, deq_back, and empty.Dequeue can be behave like a queue by using only enq_front and deq_front, and behaves like a stack by using only enq_front and deq_rear. .ike an ordinary queue, a double-ended queue is a data structure it supports the following operations: enq_front, enq_back, deq_front, deq_back, and empty. Dequeue can be behave like a queue by using only enq_front and deq_front, and behaves like a stack by using only enq_front and deq_rear. .