A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as . . . . . . . .
A. Queue
B. Stack
C. Tree
D. Linked list
Answer: Option A
This Question Belongs to Data Structure >> Introduction To Data Structures
Related Questions on Introduction to Data Structures
A. A collection of data values
B. A programming language
C. A set of algorithms
D. A way of organizing and storing data
Join The Discussion