The following program is a simple implementation of stack of integers #include using namespace std; const...

 

Transcribed Image Text:

The following program is a simple implementation of stack of integers #include <iostream> using namespace std; const int Size = 5; class Item { public: int item; Item *next; }; Item(const int &val) : }; class Stack { public: } } private: Stack() top (NULL) { } ~Stack(); int Pop(); void Push (const int&); Item *top; Stack::~Stack() { item (val), next (NULL) { Item *p while (p != NULL) { top, *q; } delete p; p = q; //add your code here int main() { } Stack s; int i; for (i = 1; i < Size; i++) s. Push(i); cout << "The element of stack are: "; for (i = 1; i < Size; i++) cout <s.Pop() << " "; return 0; Fill the missing code in the stack class so that the output of the program is: The elements of stack are: 4 3 2 1 The following program is a simple implementation of stack of integers #include <iostream> using namespace std; const int Size = 5; class Item { public: int item; Item *next; }; Item(const int &val) : }; class Stack { public: } } private: Stack() top (NULL) { } ~Stack(); int Pop(); void Push (const int&); Item *top; Stack::~Stack() { item (val), next (NULL) { Item *p while (p != NULL) { top, *q; } delete p; p = q; //add your code here int main() { } Stack s; int i; for (i = 1; i < Size; i++) s. Push(i); cout << "The element of stack are: "; for (i = 1; i < Size; i++) cout <s.Pop() << " "; return 0; Fill the missing code in the stack class so that the output of the program is: The elements of stack are: 4 3 2 1

Answer rating: 100% (QA)

The given C program snippet shows a simple stack implementation where stack elements are pushed and popped using linked list nodes which are defined b... View the full answer