/* Dev C++ */ #include #define size 3 using namespace std; class stack{ int top=-1; int s[size]; public: void push(int x){ if(top==size-1){ cout<<"Queue Overflow\n"; return; } s[++top]=x; cout<-1) cout<push(x); } void dequeue(stack *s1 ,stack *s2){ if(s2->isEmpty()){ if(s1->isEmpty()){ cout<<"Queue is empty can't deQueue\n"; return; }else{ while(!s1->isEmpty()){ s2->push(s1->pop()); } cout<pop()<<" dequeued\n"; return; } } cout<pop()<<" dequeued\n"; } void print(stack *s1, stack *s2){ cout<<"Currently Queue is : "; s2->print2(); s1->print1(); cout<>n; switch(n){ case 1: { int x; cin>>x; q.enqueue(&s1, x); break; } case 2: q.dequeue(&s1, &s2); break; case 3: q.print(&s1, &s2); break; case 4: exit(1); default: cout<<"Please enter a valid choice\n"; } } }