pythonbeatman的博客

class Stack(): #以顺序表形式实现 def __init__(self): self.__list = [] def push(self,item): #压栈 self.__list.append(item) def pop(self): #出栈 self.__list.pop() def peek(self): #弹出栈顶元素 if self

class Node(): def __init__(self,data): self.data = data self.next = None class Single_LinkedList(): def __init__(self): self.__head = None def is_empty(self): #判断链表是否为空 return self.__head == None def