Write a complete C++ program that can properly explain the each operation of De-Queue in all aspects.
Answers
Answered by
1
Answer:
Dequeue or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.
Some basic operations of dequeue are −
insert_at_beg(): inserts an item at the front of Dequeue.
insert_at_end(): inserts an item at the rear of Dequeue.
delete_fr_beg(): Deletes an item from front of Dequeue.
delete_fr_rear(): Deletes an item from rear of Dequeue.
Following is a C++ program to implement Dequeue
Similar questions