Description
1. Write your own class of stack using Dynamic array with:
a. Constructor
b. The basic functions (push, pop, size, top, empty)
c. The big three (copy constructor, destructor, assignment operator)
2. Write your own class of queue using Dynamic array with:
a. Constructor
b. The basic functions (push, pop, size, front, empty)
c. The big three (copy constructor, destructor, assignment operator)
3. Write your own class of priority queue using Dynamic array with:
a. Constructor
b. The basic functions (push, pop, size, top, empty)
c. The big three (copy constructor, destructor, assignment operator)
Note: Assume lower values have a higher priority.
4. Write a class using two stacks of your stack class to simulate a queue and their basic
functions (push, pop, size, front, empty).
5. Write a class using two queues of your queue class to simulate a stack and their basic
functions (push, pop, size, top, empty).
