One disadvantage of a list data structure is that it can be inefficient for certain operations, such as inserting or deleting elements in the middle of the list, as it requires shifting all subsequent elements.
For an array data structure, one disadvantage is that its size is fixed, which means that if it is full, additional elements cannot be added unless the array is resized. This can lead to wasted memory if the array's initial size is not well-chosen.
One disadvantage of a queue data structure is that it can be difficult to access or modify elements in the middle of the queue, as it follows a "first-in, first-out" (FIFO) order. This can limit its applications in cases where random access or modification is necessary.
In 3-5 sentences, describe one disadvantage each for list, array, and queue data structures.(4 points)
2 answers
What the answer
1 answer