/** Initialize your data structure here. */
/** Push element x to the back of queue. */
/** Removes the element from in front of queue and returns that element. */
/** Get the front element. */
/** Returns whether the queue is empty. */
* Your MyQueue object will be instantiated and called as such:
* MyQueue* obj = new MyQueue();
* int param_2 = obj->pop();
* int param_3 = obj->peek();
* bool param_4 = obj->empty();