Question: In python :Give an array based implementation of double-ended queue supporting behaviors like len (), add_first(), add_last(), delete_first(), delete_last(), first() and last(). Double-ended queue should
In python :Give an array based implementation of double-ended queue supporting behaviors like len (), add_first(), add_last(), delete_first(), delete_last(), first() and last(). Double-ended queue should be of fixed capacity. When queue is full, inserting element from one end should cause an element to be lost from the opposite side.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
