Computer scienceAlgorithms and Data StructuresData structuresLimited access data types

Queue

Theory

Array or list

Report a typo

There are two main approaches for implementing a queue: using an array or using a linked list. For every characteristic in the left column, mark the method to which it relates.

Choose one option for each row
ArrayLinkedlist
All elements are copied to a new data structure when memory overflows
Is limited by the size of the data structure
Uses dynamic memory
Comparatively more memory is required
Comparatively less memory is required
___

Create a free account to access the full topic