Array-Based vs List-Based Stacks and Queues

Question

I\'m trying to compare the growth rates (both run-time and space) for stack and queue operations when implemented as both arrays and as linked lists. So far I\'ve only been

Answer 1

Sorry if I misunderstood your question, but if I didn't, than I believe this is the answer you are looking for.

With a vector, you can only efficiently add/delete elements at the end of the container. With a deque, you can efficiently add/delete elements at the beginning/end of the container. With a list, you can efficiently insert/delete elements anywhere in the container.

vectors/deque allow for random access iterators. lists only allow sequential access.

How you need to use and store the data is how you determine which is most appropriate.

EDIT:

There is a lot more to this, my answer is very generalized. I can go into more depth if I'm even on track of what your question is about.