Write a C++ Stack class template (in Stack.h) which implements a stack. You must implement your own linked list for this. Provide the member functions empty, top, push, pop, size, as well as a constructor and a destructor. You should also implement a copy constructor and an assignment operator. Use a nested class to define the elements in the linked list.

Take your solution from the previous exercise, and change it to use the new Stack class instead of the STL stack class. Put your main program in RPN.cc.

Solution from previous exercise:

Transcribed Image Text:

1 //********************** 2 // This C++ program is a calculator which evaluates arithmetic expressions 3 // in "Reverse Polish Notation (RPN) and performs addition, subtraction, and multiplication. 4 // Inputs are recieved from the user. 5 //********************************************************************************* 6 7 #include <iostream> 8 #include <stack> 9 #include <iterator> 10 #include <cmath> 11 12 using namespace std; 13 14 int main() { 15 SARDANIS 16 17 18 19 24 25 26 27 28 29 30 31 32 33 34 stack<int> S; string s; int temp1, temp2; bool fail = false; ******************************************************** cout << "Write an equation (addition +, subtraction, and multiplication * only) in Reverse Polish Notation form. End your equation with a period (.): "; // is the end function call while (cin >> s && s!= "."){ if (s == "+") { if (S.size() <= 1) { } // temporary variables to hold the elements // bool variable used to skip ending if structure // fail == true allows us to skip if structure // check to ensure there are enough elements fail = true; cout << "INVALID EXPRESSION "; cout << "There are not enough elements to perform this operation." << endl; break; 1 //********************** 2 // This C++ program is a calculator which evaluates arithmetic expressions 3 // in "Reverse Polish Notation (RPN) and performs addition, subtraction, and multiplication. 4 // Inputs are recieved from the user. 5 //********************************************************************************* 6 7 #include <iostream> 8 #include <stack> 9 #include <iterator> 10 #include <cmath> 11 12 using namespace std; 13 14 int main() { 15 SARDANIS 16 17 18 19 24 25 26 27 28 29 30 31 32 33 34 stack<int> S; string s; int temp1, temp2; bool fail = false; ******************************************************** cout << "Write an equation (addition +, subtraction, and multiplication * only) in Reverse Polish Notation form. End your equation with a period (.): "; // is the end function call while (cin >> s && s!= "."){ if (s == "+") { if (S.size() <= 1) { } // temporary variables to hold the elements // bool variable used to skip ending if structure // fail == true allows us to skip if structure // check to ensure there are enough elements fail = true; cout << "INVALID EXPRESSION "; cout << "There are not enough elements to perform this operation." << endl; break;