A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
A. Queue
B. Circular queue
C. Dequeue
D. Priority queue
Answer:C
A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
A. Queue B. Circular queue C. Dequeue D. Priority queue
Explanation: In dequeuer, we can insert or delete elements from both ends. In the queue, we will follow the first in first out principle for insertion and deletion of elements. Element with the least priority will be deleted in a priority queue.