Circular linked list--

Circular single chain table

bool InitList(LinkList &L){
    
    L=(LNode*)malloc (sizeof(LNode));
    
    if(L==NULL){
    
        return false;
    }
    L->next=L; // Head node next Point to the head node 
    return true;
}
 
 // Sentenced to empty 
bool Empty(LinkList L){
    
    if(L->next=L)
        return true;
    else
        return false;
}

bool isTail(LinkList L){
    
if(L->next==L)
	return true;
else
	return false;
}

Circular double linked list

bool InitDLinkList(DLinkList &L){
    
    L=(LNode*)malloc (sizeof(LNode)); // Assign a head node 
    
    if(L==NULL){
    
        return false;
    }
    L->prior=L; // The first node prior Point to the head node 
    L->next=L; // Head node next Point to the head node 
    return true;
}

Double-linked list inserts and deletes , If it is a circular double linked list , Regardless of tail node NULL

Judge whether the circular double linked list is empty Is it a tail node