标签：
void addToTail(int el) { if (isEmpty()) { tail = new IntSLLNode(el); tail->next = tail; } else { tail->next = new IntSLLNode(el,tail->next); tail = tail->next; }}
void addToTail(int el) {
if (isEmpty()) {
tail = new IntSLLNode(el);
tail->next = tail;
}
else {
tail->next = new IntSLLNode(el,tail->next);
tail = tail->next;
3.3 循环链表
原文地址：http://www.cnblogs.com/star91/p/4761755.html
