C++

#include using namespace std;

const int MAXSIZE = 20; class Stack { public: Stack(); bool Empty(); void Push(int item); void Pop(); int Top(); void displayStack(); private: int stk[MAXSIZE]; int top; };

Stack::Stack() { top = 0; } bool Stack::Empty() { if (top == 0) return true; else return false; } void Stack::Push(int item) { stk[top] = item; top++; } void Stack::Pop() { top--; } int Stack::Top() { return stk[top]; } void Stack::displayStack() { for (int i = 0; i

Postfix notation is a notation for writing arithmetic expressions in which the operands appear before their operators. There are no precedence rules to learn, and parentheses are never needed. For example, 2 5 is 7. In postfix notation, we will write 25(that means 2 and 5 are the two operands and+ is the operation that will be applied to those two operands) so the answer will be. Another examplewll be 4 5 6 8 .This will take 4 and 5, then add them to get 9. It will then take 9 and 6, then subtract them to get 3. Finally, 3 and 8 will be multiplied and get 24 as the result. We can use the stack to do these operations. Let's first learn the stack structures. You may assume the classes Stack hold integers class Stack will contain the usual functions: bool Empty void Pus int item); void Pop int TopO Exercise: 1. (30 points) What is printed to the screen in the following code? Stack A; Stack B; for (int k= 61; k(# 70; k++) { if (k 3)0) A. Push () else B. Push (k) while (!B.Empty)) cout