Arrays, Linked Lists, Queue and Stack Data Structures in C++

See Question.pdf, Stack.cpp and Queue.cpp

• Question.pdf
• Queue.cpp
• Stack.cpp

Problem 1. a)
The differences between array-based list and singly linked list data structures can be analyzed from at least the following three perspectives: memory space requirements for storing, access mode and the cost of the basic operations on their items.
The implementations based on arrays have two major drawbacks compared to the implementations based on linked lists: the fixed size (unless it is used the “vector” class) and the cost of basic operations like insertion and deletion (generally these have linear cost which is considered expensive in practice). Because of the fixed size it is needed to allocate the maximum required memory amount – regardless if the application uses it or not...

This is only a preview of the solution. Please use the purchase button to see the entire solution