Python implements stacks and queues

Class Node: #节点类
Next = The none# node pointer points to the next
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 node
Q = 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.next
S =stack ()
S.add (Node (1)) #进栈
S.add (Node (2)) #进栈
S.add (Node (3)) #进栈
S.out () #出栈

Python implements stacks and queues