1
Question
A data structure where elements can be added or removed at either end but not in the middle is called ____________.
A data structure where elements can be added or removed at either end but not in the middle is called ____________.
Open in App
Solution
The correct option is C Dequeue
Dequeue (double-ended queues) are the refined queues in which elements can be added or removed at either end but not in the middle. There are two variations of a dequeue- Input restricted dequeue and Output restricted dequeue.
Dequeue (double-ended queues) are the refined queues in which elements can be added or removed at either end but not in the middle. There are two variations of a dequeue- Input restricted dequeue and Output restricted dequeue.
Suggest Corrections
4
Similar questions
View More
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
