Introduction - If you have any usage issues, please Google them yourself
The assumption that a one-way circle to indicate the queue list (that is, the cycle chain teams), which is only a team queue tail pointer, the first team with no indicators, test the preparation of the following computing algorithm: 1) to insert a cycle chain team element value of node x. 2) teams from the cycle of chain to remove a node. 3) Access Queue