一个单向循环链表来表示队列（即循环链队），该队列只设一个队尾指针，不设队首指针，实现以下算法：

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

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

3）访问队列

-A one-way circular list to represent the queue (ie, cycle chain team), the queue tail pointer only to set up a team with no team in the first pointer, to achieve the following algorithm:

1) to insert an element of circular chain of team value of x, nodes.

2) From the cycle chain team to remove a node.

3) Access Queue