A data structure where elements can be added or removed at either end but not in

Question - A data structure where elements can be added or removed at either end but not in the middle is referred as

Options:

A . Linked lists

B . Stacks

C . Queues

D . Deque

Answer: Option D

Submit Your Solution Below and Earn Points !

Next Question