Queue (C language / linked list)

Store the queue with a linked list , The principle is to put two head pointers and tail pointers , Add elements at the end of the team , Delete elements at the head of the team , Understand this principle , Just consider the special circumstances , For example, if there is no element in the queue after deleting an element, point the head pointer and tail pointer to null in time , The rest depends on the code

#include<stdio.h>
#include<windows.h>
typedef struct LinkLNode
{
    
    int data;
    struct LinkLNode* next;
}LinkLNode;
typedef struct 
{
    
    LinkLNode* rear;
    LinkLNode* front;
    int item;
}LinkQueue;
void Init(LinkQueue &Q){
    
    LinkLNode* s;
    s=(LinkLNode*)malloc(sizeof(LinkLNode));
    Q.front=NULL;
    Q.rear=NULL;
    Q.item=0;
}
bool IsEmpty(LinkQueue Q){
    
    if(Q.front==NULL)
    return true;
    else
    return false;
}
void EnQueue(LinkQueue &Q,int n){
    
    LinkLNode* s;
    s=(LinkLNode*)malloc(sizeof(LinkLNode));
    s->data=n;
    s->next=NULL;
    if(IsEmpty(Q)){
    
        Q.front=s;
    }else{
    
        Q.rear->next=s;
    }
    Q.rear=s;
    Q.item++;
}
void DeQueue(LinkQueue &Q){
    
    if(IsEmpty(Q)){
    
        return;
    }
    LinkLNode* s;
    s=Q.front;
    Q.front=Q.front->next;
    free(s);
    if(Q.item==0){
    
        Q.front=NULL;
        Q.rear=NULL;
    }
}
void printQueue(LinkQueue Q){
    
    LinkLNode* i=(LinkLNode*)malloc(sizeof(LinkLNode));
    i=Q.front;
    while(i!=NULL){
    
        printf("%d\n",i->data);
        i=i->next;
    }
}
int main()
{
    
    LinkQueue Q;
    Init(Q);
    int n;
    int a[10];
    scanf("%d",&n);
    for (int i = 0; i < n; i++)
    {
    
        scanf("%d",&a[i]);
        EnQueue(Q,a[i]);
    }
    printQueue(Q);
    printf("***\n");
    DeQueue(Q);
    printQueue(Q);
    system("pause");
    return 0;
}