stackusingqueuecpy.txt

#include <stdio.h>
#define MAX 50
int queue1[MAX],queue2[MAX];
int front1 = -1,rear1 = -1,front2 = -1,rear2 = -1;
int count;

void enqueue1(int x)
{
    if(front1==-1)
        front1 = 0;

    queue1[++rear1] = x;
    printf("queue1 %d\n",queue1[rear1]);
    
}

void enqueue2(int x)
{
    if(front2==-1)
        front2 = 0;

    queue2[++rear2] = x;
      printf("queue2 %d\n",queue2[rear2]);
    
}

int dequeue1()
{
    int x = queue1[front1++];
    return x;
}

int dequeue2()
{
    int x = queue2[front2++];
    return x;

}

void push(int x)
{
    if(rear1==MAX-1)
        printf("overflow\n");
    else
    {
        enqueue1(x);
        count++;
    }
}

void pop()
{
 
    while(front1<=rear1)
        enqueue2(dequeue1());
    
    while(front2<rear2)
        enqueue1(dequeue2());

    printf("The popped element is %d\n",dequeue2());
   
}

int main()
{
    push(10);
    push(20);
    push(100);
    pop();
    pop();
    pop();
    push(10756);
    pop();
}