class Stack: def __init__(self,size=20): self.stack= [] self.size= size; self.top= -1 def setSize(self,size): self.size=size; def push(self,element): if self.isFull(): raise "StackOverflow" else: self.stack.append(element) self.top = self.top + 1 def pop(self): if self.isEmpty(): raise "StackUnderflow" else: element=self.stack[-1] self.top=self.top-1; del self.stack[-1] return element def Top(self): return self.top def empty(self): self.stack=[] self.top=-1 def isEmpty(self): if self.top == -1: return True else: return False def isFull(self): if self.top == self.size-1: return True else: return False if __name__ == "__main__": stack=Stack() for i in range(10): stack.push(i) print stack.Top() for i in range(10): print stack.pop() stack.empty() print stack.Top()