Question

In 3-5 sentences, describe one disadvantage each for list, array, and queue data structures.

Answer 1

**List**: A disadvantage of lists is their potential inefficiency in accessing elements by index, as it requires a traversal from the beginning of the list, resulting in O(n) time complexity for accessing non-first elements.

**Array**: Arrays have a fixed size, which makes them inflexible; if more elements need to be stored than the array can accommodate, a new larger array must be created and elements copied, leading to additional overhead.

**Queue**: A disadvantage of queues is that they follow a strict FIFO (First-In-First-Out) principle, which can limit access to elements, making it difficult to retrieve or modify items that are not at the front of the queue without removing them.