Question: Question 9 A data structure in which elements can be inserted or deleted at / from both ends but not in the middle is ?

Question 9
A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
Your answer:
priority queue
queue
circular queue
dequeue
 Question 9 A data structure in which elements can be inserted

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!