Question

main.py x 1 from collections import deque 2 3 # complete the following classes 4 class Stack: 5 6 def init(self): 7 self.data = deque() 8 9 10 class Queue: 11 12 def init(self): 13 self.data = deque() 14 15

          main.py x
1 from collections import deque
2
3 # complete the following classes
4 class Stack:
5
6 def __init__(self):
7 self.__data = deque()
8
9
10 class Queue:
11
12 def __init__(self):
13 self.__data = deque()
14
15

Added by Kenneth K.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Donna Densmore

Step 1

We need to add elements to the top of the stack using the push() method, remove and return elements from the top of the stack using the pop() method, get the size of the stack using the get_size() method, and print the elements from first added to last using the Show more…

Show all steps

Thanks for your feedback!

PLEASE WRITE THE CODE IN PYTHON. INSTRUCTIONS AND STARTER CODE PROVIDED BELOW. Write your own Stack and Queue class, but it should use a deque instead of a Python List. It should have the following methods: - constructor (unchanged) - add elements to each (push() & enqueue()) - remove and return elements from each (pop() & dequeue()) - get_size() - returns the number of elements - print_elements() - prints elements from first added to last. main.py 1 from collections import deque 2 3 # complete the following classes 4 class Stack: 5 6 def __init__(self): 7 self.data = deque() 8 10 class Queue: 11 12 def __init__(self): 13 self.data = deque() 14