python数据结构--顺序表的栈和队列

栈的实现过程：

class Seq_Stack:
    def __init__(self):
        self.stack=[]
        self.size=0
    def my_push(self,value):
        self.stack.append(value)
        self.size+=1
    def my_pop(self):
        if self.size<=0:
            return None
        else:
            self.size -= 1
            return self.stack.pop()
    def stack_top(self):
        if self.size<=0:
            return None
        else:
            return self.stack[self.size-1]
    def isempty(self):
        if self.size==0:
            return True
        else:
            return False

 测试： 

seq = Seq_Stack()
print("该栈为空：",seq.isempty())
print(seq.stack_top())
print(seq.stack_top())
seq.my_push(53)
seq.my_push(27)
print(seq.stack_top())

结果： 

该栈为空： True
None
None
27

队列的实现过程：

class Seq_queue:
    def __init__(self):
        self.queue=[]
    def enqueue(self,value):
        self.queue.append(value)
    def dequeue(self):
        if len(self.queue)==0:
            return None
        else:
            return self.queue.pop(0)
    def isempty(self):
        if(len(self.queue)==0):
            return True
        else:
            return False
    def find_size(self):
        return len(self.queue)
    def find_head(self):
        if (len(self.queue) == 0):
            return None
        else:
            return self.queue[0]
    def detail(self):
        print("队列：",end="")
        for i in self.queue:
            print(i,end="   ")
        print(" ")

测试：

my_queue=Seq_queue()
print(my_queue.isempty())
print(my_queue.find_size())
print(my_queue.find_head())
my_queue.enqueue(1)
my_queue.enqueue(2)
my_queue.detail()
my_queue.dequeue()
my_queue.dequeue()
my_queue.detail()
print(my_queue.isempty())
print(my_queue.find_size())
print(my_queue.find_head())

 结果：

True
0
None
队列：1   2    
队列： 
True
0
None