| 62 | count++; |
| 63 | } |
| 64 | void dequeue() |
| 65 | { |
| 66 | if((top1==-1) && (top2==-1)) |
| 67 | { |
| 68 | printf("\nQueue is empty"); |
| 69 | } |
| 70 | else |
| 71 | { |
| 72 | for(int i=0;i<count;i++) |
| 73 | { |
| 74 | int element = pop1(); |
| 75 | push2(element); |
| 76 | } |
| 77 | int b= pop2(); |
| 78 | printf("\nThe dequeued element is %d", b); |
| 79 | printf("\n"); |
| 80 | count--; |
| 81 | for(int i=0;i<count;i++) |
| 82 | { |
| 83 | int a = pop2(); |
| 84 | push1(a); |
| 85 | } |
| 86 | }} |
| 87 | void display() |
| 88 | { |
| 89 | for(int i=0;i<=top1;i++) |