12. Queue/QueueUsingStacks.cpp
void push1(int data)  
{  
// Condition to check whether the stack1 is full or not.    
 if(top1==N-1)  
{  
   printf("\n Stack is overflow...");  
}  
else  
{  
   top1++;   // Incrementing the value of top1  
   stack1[top1]=data;  // pushing the data into stack1  
}  
}
// inserting the elements in stack1.  
inserting the elements in stack1.
inserting the elements in stack1 .
void push1(int data)  
{  
 if(top1==N-1)  
{  
   printf("\n Stack is overflow...");  
}  
else  
{  
   top1++;   
   stack1[top1]=data;  
}  
}
void push1 ( int data ) { if ( top1 == N - 1 ) { printf ( " \n " ) ; } else { top1 ++ ; stack1 [ top1 ] = data ; } }
inserting the elements in stack1.
inserting the elements in stack1 .
// Condition to check whether the stack1 is full or not.     // Incrementing the value of top1   // pushing the data into stack1  