数据结构–栈和队列python实现
1.栈(先进后出)
class Stack:
def __init__(self):
self.__list = []
def is_empty(self):
return self.__list == []
def push(self, item):
self.__list.append(item)
def pop(self):
if self.__list:
self.__list.pop()
else:
return None
def stack_size(self):
return len(self.__list)
def peek(self):
if self.__list:
return self.__list[-1]
else:
return None
2.队列(先进先出)
class Queue:
def __init__(self):
self.__list == []
def is_empty(self):
return self.__list == []
def enqueue(self, item):
self.__list.append(item)
def dequeue(self):
if self.__list:
return self.__list.pop(0)
else:
return None