目前只实现了三种,栈、队列和二叉树,哪天得空继续补吧~ 毕设忙晕了~~ 1.栈 #栈 class Stack: def __init__(self,size = 16): self.stack = [] self.size = size self.top = -1 def setSize(self, size): self.size = size def isEmpty(self): if self.top == -1: return True else: return False def isFull(self): if self.top +1 == self.size: return True else: return False def top(self): if self.isEmpty(): raise Exception("StackIsEmpty") else: return self.stack[self.top] def push(self,obj): if self.isFull(): raise Exception("StackOverFlow") else: self.stack.append(obj) self.top +=1 def pop(self): if self.isEmpty():