链式队列是一种特殊的线性表，它只允许在表的前端（front）进行删除操作，而在表的后端（rear）进行插入操作。进行插入操作的端称为队尾，进行删除操作的端称为队头。队列中没有元素时，称为空队列。一般队列的存储结构是顺序存储，当队列的存储结构是链式存储结构时（即队列中每个元素都包含一个指向其后继的指针，最后一个元素指针为null)，就是链式队列，和链栈同理。-A queue is a special kind of linear form, it only allows the front end of the table (front) delete operation, and the rear end of the table (rear) for insertion. Insert operation is called the tail end, the end delete operation called HOL. No element in the queue, it is called an empty queue. General queue storage structure is stored in order, when the queue storage structure is linked storage structure (ie the queue each element contains a pointer to a pointer to its successor, the last element pointer is null), is a chain queues, and Chain stack empathy.