假定一个单向循环链表来表示队列（即循环链队），该队列只设一个队尾指针，不设队首指针，试编写下列各种运算的算法：

1）　　向循环链队插入一个元素值为x的结点。

2）　　从循环链队中删除一个结点。

3）　　访问队列

-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