队列的链表存储——python

'''存在两个指针，类似于头指针和尾指针'''
class Node(object):
    def __init__(self,item):
        self.item=item
        self.next=None

class LinkQueue(object):
    def __init__(self):
        n=Node(None)
        self.head = n
        self.rear = n

    '''判断是否为空'''
    def is_empty(self):
        return self.head is self.rear

    '''进队列'''
    def push(self,item):
        node = Node(item)
        self.rear.next = node
        self.rear = node

    '''出队列'''
    def pop(self):
        if self.is_empty():
            print('队列为空')
            return
        else:
            t = self.head.next
            self.head.next = t.next
            if self.rear == t:
                self.rear = self.head
            return t.item

    '''返回队列第一个元素'''
    def gettop(self):
        if self.is_empty():
            print('队列为空')
            return
        else:
            return self.head.next.item

    '''遍历队列内的所有元素'''
    def printqueue(self):
        if self.is_empty():
            print('队列为空')
            return
        else:
            while self.head!=self.rear:
                result=self.pop()
                print(result,end=' ')

    '''创建队列'''
    def creatqueue(self):
        data=input('请输入，以 # 结束:')
        while data!='#':
            self.push(data)
            data = input('请输入，以 # 结束:')



if __name__=="__main__":
    l=LinkQueue()
    l.creatqueue()
    print(l.gettop())