Question: What is the name where elements can be inserted or deleted, in a non-primitive linear data structure, from both the ends but not in the
What is the name where elements can be inserted or deleted, in a non-primitive linear data structure, from both the ends but not in the middle?
A. Queue
B. Circular queue
C. Dequeue
D. Priority queue
Step by Step Solution
3.35 Rating (164 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
