3.3 循环链表
![](https://images0.cnblogs.com/blog/801509/201508/262143005471180.png)
循环单向链表
![](https://images0.cnblogs.com/blog/801509/201508/262143010478265.png)
图(a)添加头节点 图(b)添加尾节点
void addToTail(int el) {
if (isEmpty()) {
tail = new IntSLLNode(el);
tail->next = tail;
}
else {
tail->next = new IntSLLNode(el,tail->next);
tail = tail->next;
}
- }