队列的基本程序代码，比如入队，出队，取队头，此代码用链表的方式采用的FIFO(first in first out)，新元素(等待进入队列的元素)总是被插入到链表的尾部，而读取的时候总是从链表的头部开始读取。每次读取一个元素，释放一个元素。所谓的动态创建，动态释放。因而也不存在溢出等问题。由于链表由结构体间接而成，遍历也方便。-The basic code of the queue, for example into the team, the team, the first team to take this code with a list of ways using FIFO (first in first out), the new element (queue waiting to enter the elements) is always inserted into the end of the list and the time to read always read　the head of the list. Read one element, a release element. The so-called dynamic creation, dynamic release. Thus there was no overflow problems. Since the list is made indirectly by the structure, but also easy to traverse.