Introduction - If you have any usage issues, please Google them yourself
The queue is a special linear list, and the special thing is that it only allows the deletion of the front end of the table (front), and the insertion operation at the back end of the table (rear), just like the stack, the queue is a restricted linear list. The end of the insertion operation is called the queue tail, and the end of the deletion operation is called the header.