GkSeries.com
Home
GK
ENGLISH
CURRENT AFFAIRS
APTITUDE
REASONING
BANKING
UGC NET
COMPUTER SC.
COURSES
Home
Computer Science
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 ......
A
stacks
B
queues
C
dequeue
D
linked lists
Answer & Explanation
Option: [C]
⭐ Make GKSeries Your Preferred Source on Google
Add GKSeries as Preferred Source
Next Question →