232. Implement Queue using Stacks

Implement the following operations of a queue using stacks.

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

class Queue {
public:
    // Push element x to the back of queue.
    void push(int x) {
        this->stc1.push(x);
    }

    // Removes the element from in front of queue.
    void pop(void) {

        this->peek();
        this->stc2.pop();
    }

    // Get the front element.
    int peek(void) {
        if(this->stc2.empty())
            this->move1to2();
        return stc2.top();
    }

    // Return whether the queue is empty.
    bool empty(void) {
        return (stc1.empty()&&stc2.empty());
    }
private:
    void move1to2()
    {
        while(!this->stc1.empty())
        {
            stc2.push(stc1.top());
            stc1.pop();
        }

    }
private:
    stack<int> stc1;
    stack<int> stc2;
};