#include #include using namespace std; void appendStack(stack *s, int a) { if (s->empty()) { s->push(a); return; } else { int o = s->top(); s->pop(); cout<size()<push(o); } } void revertStack(stack *s) { if (s->empty()) { return; } else { int a = s->top(); s->pop(); revertStack(s); cout< stackarg) { cout<<"Stack :"; while(!stackarg.empty()) { cout< mystack; mystack.push(1); mystack.push(2); mystack.push(3); mystack.push(4); revertStack(&mystack); display_stack(mystack); return 0; }