#include

#define SIZE 10

using namespace std;

class Stack

{

int stack[SIZE],top;

public:

Stack() //Constructor for initializing top

{

top=-1;

}

void push(int num)

{

if(top==SIZE-1) //Stack is full

{

cout<<" STACK OVERFLOW";

}

else

{

top++;

stack[top]=num;

}

}

void pop()

{

int num;

if(top==-1) //Stack is empty

{

cout<<" STACK UNDERFLOW";

}

else

{

num=stack[top];

top--;

cout<<" ELEMENT DELETED: "<

}

}

void traverse()

{

if(top==-1)

{

cout<<" STACK IS EMPTY";

}

else

{

cout<<" STACK ELEMENTS ";

for(int i=top;i>=0;i--)

{

cout<

}

}

}

};

int main()

{

Stack s;

s.traverse();

s.push(40);

s.push(50);

s.push(60);

s.traverse();

s.pop();

s.traverse();

return 0;

}

Every line in this code please explain