How to implement Stack in python

Question

I have 2 issues with the code below:

1. push(o) throws an exception TypeError: can only assign an iterable.

2. Should I throw an exception if pop() is invoked on an empty stack ?

   class Stack(object):
   
       def __init__(self):
           self.storage = []
   
       def isEmpty(self):
           return len(self.storage) == 0
   
       def push(self,p):
           self.storage[:0] = p
   
       def pop(self):
           """issue: throw exception?"""
           return None

Answer 1

class Stack:
  def __init__(self):
    self.__storage = []

  def isEmpty(self):
    return len(self.__storage) == 0

  def push(self,p):
    self.__storage.append(p)

  def pop(self):
    return self.__storage.pop()

This way you can securely implement all the functions of stack.

Answer 2

There are different method to implement stack in python

one of theme i am explain in detailed

# Python program to 
# demonstrate stack implementation 
# using list 

stack = [] 

# append() function to push 
# element in the stack 
stack.append('a') 
stack.append('b') 
stack.append('c') 

print('Initial stack') 
print(stack) 

# pop() fucntion to pop 
# element from stack in 
# LIFO order 
print('\nElements poped from stack:') 
print(stack.pop()) 
print(stack.pop()) 
print(stack.pop()) 

print('\nStack after elements are poped:') 
print(stack) 

# uncommenting print(stack.pop()) 
# will cause an IndexError
# as the stack is now empty

OUTPUT

Initial stack
['a', 'b', 'c']

Elements poped from stack:
c
b
a

Stack after elements are poped:
[]

Best of luck!!!!