Question
Which data structure or concept is best described as a queue that reuses freed positions by wrapping indices?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Circular Queue
Explanation:
Circular Queue is a queue that reuses freed positions by wrapping indices.
This description distinguishes it from the other choices.
Leave a Reply