class Stack(object):

def __init__(self):

self.stack=[]

def isEmpty(self):

return self.stack==[]

def push(self,item):

self.stack.append(item)

def pop(self):

if self.isEmpty():

raise IndexError,'pop from empty stack'

return self.stack.pop()

def peek(self):

return self.stack[-1]

def size(self):

return len(self.stack)

class Queue:

def __init__(self, head=None):

self.storage = [head]

def enqueue(self, new_element):

self.storage.append(new_element)

def peek(self):

return self.storage[0]

def dequeue(self):

return self.storage.pop(0)

暂无解析