Create stack_using_queue.cpp

Author: avidLearnerInProgress

stack_using_queue.cpp

@@ -0,0 +1,49 @@
+class MyStack {
+public:
+    /** Initialize your data structure here. */
+    queue<int> mainQueue, tempQueue;
+    MyStack() {
+    }
+    
+    /** Push element x onto stack. */
+    void push(int x) {
+        while(!mainQueue.empty())
+        {
+            tempQueue.push(mainQueue.front());
+            mainQueue.pop();
+        }
+        mainQueue.push(x);
+        while(!tempQueue.empty())
+        {
+            mainQueue.push(tempQueue.front());
+            tempQueue.pop();
+        }
+    }
+    
+    /** Removes the element on top of the stack and returns that element. */
+    int pop() {
+        int val = mainQueue.front();
+        mainQueue.pop();
+        return val;
+    }
+    
+    /** Get the top element. */
+    int top() {
+        return mainQueue.front();
+    }
+    
+    /** Returns whether the stack is empty. */
+    bool empty() {
+        return mainQueue.empty();
+    }
+};
+
+
+/**
+ * Your MyStack object will be instantiated and called as such:
+ * MyStack* obj = new MyStack();
+ * obj->push(x);
+ * int param_2 = obj->pop();
+ * int param_3 = obj->top();
+ * bool param_4 = obj->empty();
+ */