队列是一种先进先出的线性表，它只允许在表的一端进行插入，而在另一端进行删除元素。用链表表示的队列简称链队列。一个链队列需要两个分别指向队头和队尾的指针。顺序队列除了用一组地址连续的存储单元依次存放从队头到队尾的元素外，还需要两个指针front和rear分别指示队列头元素和队列尾元素的位置。

定义顺序队列类型，实现队列的所有基本操作。

定义链队列类型，实现队列的所有基本操作。

-FIFO queue is a linear form, it only allows to insert one end of the table, while at the other end delete elements. Queue queue with the list referred to chain represented. A chain requires two separate queue pointer to the head and the tail of the team. In addition to a set of sequential queue addresses contiguous memory locations to store the elements sequentially　the head to the tail of the team, but also need two pointers indicate the position of front and rear elements of the queue head and queue tail elements. Defined queue type sequence, the realization of all the basic operations of the queue. Defined queue type chain, the realization of all the basic operations of the queue.