LinearList/LoopSingleLinkList.c
void tailInsert(Node* L, int data) {
    Node* n = L;
    Node* node = (Node*)malloc(sizeof(Node));
    node->data = data;
    while (n->next != L) {
        n = n->next;
    }
    node->next = L;
    n->next = node;
    L->data++;
}
/**
 * insert item in link list's tail
 * @param L the head pointer of link list
 * @param data the data you want to insert
 */
insert item in link list's tail
@param L the head pointer of link list
@param data the data you want to insert
insert item in link list ' s tail @param L the head pointer of link list @param data the data you want to insert
void tailInsert(Node* L, int data) {
    Node* n = L;
    Node* node = (Node*)malloc(sizeof(Node));
    node->data = data;
    while (n->next != L) {
        n = n->next;
    }
    node->next = L;
    n->next = node;
    L->data++;
}
void tailInsert ( Node * L , int data ) { Node * n = L ; Node * node = ( Node * ) malloc ( sizeof ( Node ) ) ; node -> data = data ; while ( n -> next != L ) { n = n -> next ; } node -> next = L ; n -> next = node ; L -> data ++ ; }
insert item in link list's tail
 @param L the head pointer of link list
 @param data the data you want to insert
insert item in link list ' s tail @param L the head pointer of link list @param data the data you want to insert