python实现栈和队列

class Node:#节点类    next = None#节点指针指向下一个    def __init__(self,data):        self.data=data------------------------------------------class Queue:    first = Node(None)#头节点    last = Node(None)#尾节点    def inQueue(self,node):#进队列        if self.first.data==None:            self.first = node            self.last = node        else:            self.last.next = node            self.last = node    def deQueue(self):#出队列        node = self.first        self.first = self.first.next        return nodeq = Queue()#创建队列对象q.inQueue(Node(1))#进队q.inQueue(Node(2))#进队n = q.deQueue()#出队m = q.deQueue()#出队print n.data,m.data--------------------------------class Stack:#栈    top = Node(None)    def add(self,node):#进栈        node.next=self.top        self.top = node    def out(self):#出栈        node =self.top        while node.data!=None:            print node.data,            node= node.nexts =Stack()s.add(Node(1))#进栈s.add(Node(2))#进栈s.add(Node(3))#进栈s.out()#出栈

来源：https://www.cnblogs.com/nknk/p/8412520.html