栈和队列在python中的数据结构

栈的数据结构

# coding=utf-8class Stack():def __init__(st,size):st.stack=[];st.size=size;st.top=-1;def push(st,content):if st.Full():print "Stack is Full!"else:st.stack.append(content)st.top=st.top+1def Full(st):if st.top==st.size:return Trueelse:return Falsedef Empty(st):if st.top==-1:return  Trueelse:return  Falsedef Out(st):if st.Empty():print"The stack is empty!"else:st.top=st.top-1

队列的数据结构

class Queue():def __init__(qu,size):qu.Queue=[];qu.size=size;qu.head=-1;qu.tail=-1;def Empty(qu):if qu.head==qu.tail:return Trueelse:Falsedef Full(qu):if qu.tail-qu.head+1==qu.size:return Trueelse:return Falsedef enQueue(qu,content):if qu.Full():print "the Queue is Full!"else:qu.Queue.append(content)qu.tail=qu.tail+1def outQueue(qu):if qu.Empty():print "the Queue is empty!"else:qu.head=qu.head+1