Stack/Stack implementation using two queue.cpp
// Remove the top item from the stack    
Remove the top item from the stack
Remove the top item from the stack
int pop()
{
        if (q1.empty())
        {
            cout << "Underflow!!";
            exit(0);
        }
        int front = q1.front();
        q1.pop();
        return front;
}
int pop ( ) { if ( q1 . empty ( ) ) { cout << " " ; exit ( 0 ) ; } int front = q1 . front ( ) ; q1 . pop ( ) ; return front ; }
Remove the top item from the stack
Remove the top item from the stack
// if the first queue is empty // return the front item from the first queue