225. Implement Stack using Queues

Implement the following operations of a stack using queues.

push(x) – Push element x onto stack.
pop() – Removes the element on top of the stack.
top() – Get the top element.
empty() – Return whether the stack is empty.
Notes:
You must use only standard operations of a queue – which means only push to back, peek/pop from front, size, and is empty operations are valid.
Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).

class Stack {
public:
    // Push element x onto stack.
    void push(int x) {
        if(qu1.empty())
        {
            qu1.push(x);
            while(!qu2.empty())
            {
                qu1.push(qu2.front());
                qu2.pop();
            }
        }else
        {
            qu2.push(x);
            while(!qu1.empty())
            {
                qu2.push(qu1.front());
                qu1.pop();
            }
        }        

    }

    // Removes the element on top of the stack.
    void pop() {

        if(qu1.empty())
        {
            qu2.pop();
        }else
        {
            qu1.pop();
        }
    }

    // Get the top element.
    int top() {
        int tmp;
        if(qu1.empty())
        {
            tmp = qu2.front();
        }else
        {
            tmp = qu1.front();
        }
        return tmp;
    }

    // Return whether the stack is empty.
    bool empty() {
        return qu1.empty() && qu2.empty();
    }
private:
    queue<int> qu1;
    queue<int> qu2;
};