Sure, here is a Python implementation of a Stack using two Queues. The idea is to push the elements into the Queue1 and to pop an element, remove all the elements from Queue1 into Queue2 except the last one, then swap the names of Queue1 and Queue2.

```python
from queue import Queue

class Stack:
def __init__(self):
self.q1 = Queue()
self.q2 = Queue()
self.curr_size = 0

def push(self, x):
self.curr_size += 1
self.q2.put(x)

Question

Sure, here is a Python implementation of a Stack using two Queues. The idea is to push the elements into the Queue1 and to pop an element, remove all the elements from Queue1 into Queue2 except the last one, then swap the names of Queue1 and Queue2.

```python
from queue import Queue

class Stack:
    def __init__(self):
        self.q1 = Queue()
        self.q2 = Queue()
        self.curr_size = 0

def push(self, x):
        self.curr_size += 1
        self.q2.put(x)

Knowee AI · Accepted Answer

Sure, here is a Python implementation of a Stack using two Queues. The idea is to push the elements into the Queue1 and to pop an element, remove all the elements from Queue1 into Queue2 except the last one, then swap the names of Queue1 and Queue2.

```python
from queue import Queue

class Stack:
    def __init__(self):
        self.q1 = Queue()
        self.q2 = Queue()
        self.curr_size = 0

def push(self, x):
        self.curr_size += 1
        self.q2.put(x)

Implement Stack using Queues

Question

Solution

Similar Questions

Upgrade your grade with Knowee