Python: Stack with Push, Pop and seek Minimum Value with O(1)

class Stack:
    def __init__(self):
        self.items = []
        self.minList = []
        self.min = None
 
    def push(self, item):
        print("Push: ", item)
        self.items.append(item)
        if not self.min:
            self.min = item
        else:
            if item <= self.min:
                self.minList.append(self.min)
                self.min = item
 
        self.printAll()
 
    def pop(self):
        if self.items:
            item = self.items.pop()
            if item == self.min:
                self.min = self.minList.pop() if self.minList else None
            print("Pop: ", item)
 
            self.printAll()
            return item
 
        print("Pop: ", None)
 
        self.printAll()
        return None
 
    def seekMin(self):
        print("Min: ", self.min)
        return self.min
 
    def printAll(self):
        print('Items: ' , self.items)
        print('Min List: ' , self.minList)
        print('Min: ' , self.min)
        print()
 
stack = Stack()
stack.push(5)
stack.push(3)
stack.pop()
stack.push(2)
stack.push(2)
stack.push(4)
stack.push(7)
stack.push(3)
stack.pop()
stack.push(1)
stack.pop()
stack.pop()
stack.pop()
 
stack.seekMin()