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

Rohith

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



A) Linked lists
B) Stacks
C) Queues
D) Deque

Answer & Solution Answer: Option D
Solution:
Deque.

Post a Comment

Cookie Consent
We serve cookies on this site to analyze traffic, remember your preferences, and optimize your experience.
Oops!
It seems there is something wrong with your internet connection. Please connect to the internet and start browsing again.
Site is Blocked
Sorry! This site is not available in your country.