Question
Which data structure or concept is best described as a double-ended queue supporting insertion and deletion at both ends?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Deque
Explanation:
Deque is a double-ended queue supporting insertion and deletion at both ends.
This description distinguishes it from the other choices.
Leave a Reply