Implement a queue with two stacks to complete the push and pop operations of the queue. The elements in the queue are of type int.

Idea: Use Stack1 to implement the queue push operation, with Stack2 to achieve the queue of pop operations, when the Stack2 is empty, the stack1 of the data are all pressed into Stack2, waiting for the queue of pop operations.

Class solution
{public
:
    void push (int node) {
        Stack1.push (node);
    }

    int pop () {
        int result;
        if (Stack2.empty ()) {
            while (!stack1.empty ()) {
                Stack2.push (stack1.top ());
                Stack1.pop ();
            } 
        }
        result = Stack2.top ();
        Stack2.pop ();
        return result;
    }

Private:
    stack<int> stack1;
    Stack<int> stack2;
};