Description: 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.
To Search:
File list (Check if you may need any files):
linkqueue.c
Download