python栈结构

#栈
class Stack:
    def __init__(self):
        self.__elements=[]

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

    def peek(self):
        if  self.isEmpty():
            return None
        else:
            return self.__elements[len(self.__elements)-1]

    def push(self,value):
        self.__elements.append(value)

    def pop(self):
        if not self.isEmpty():
           return self.__elements.pop()
        else:
            return None

    def getSize(self):
        return len(self.__elements)

def main():
    stack=Stack()
    for i in range(10):
        stack.push(i)

    while not stack.isEmpty():
        print(stack.pop(),end=" ")

main()