Introduction - If you have any usage issues, please Google them yourself
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.