1、使用python实现栈：
class stack():
def __init__(self):
self.stack = []
def empty(self):
return self.stack==[]
def push(self,data):
self.stack.append(data)
def pop(self):
if self.empty():
return None;
else:
return self.stack.pop(-1)
def top(self):
if self.empty():
return None
else:
return self.stack[-1]
def length(self):
return len(self.stack)
2、使用python实现队列：
class queue():
def __init__(self):
self.queue = []
def empty(self):
return self.queue == []
def enqueue(self,data):
self.queue.append(data)
def dequeue(self):
if self.empty():
return None
else:
return self.queue.pop(0) #返回头信息和队列长度可以不实现
def head(self):
if self.empty():
return None
else:
return self.queue[0]
def length(self):
return len(self.queue)