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.

linkqueue.c

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．