Find the middle element of a linked list

#include<stdio.h>

struct node
{
    int data;
    struct node *next;
}*head;

int main()
{
    int n,mid;
    printf("Enter total number of node: ");
    scanf("%d",&n);

    createList(n);

    printf("\nList is\n ");

    displaylist();

    mid=findmid();

    printf("\nMiddle of the element is %d: ",mid);

    return 0;
}
void createList(int n)
{
    struct node *p,*temp;
    int i,data;

    temp=(struct node *)malloc(sizeof(struct node));

    printf("Enter the data of the node 1: ");
    scanf("%d",&data);

    temp->data=data;
    temp->next=NULL;

    p=temp;
    head=temp;

    for(i=2; i<=n; i++)
    {
        temp=(struct node *)malloc(sizeof(struct node));

        printf("Enter the data of the node %d: ",i);
        scanf("%d",&data);

        temp->data=data;
        temp->next=NULL;

        p->next=temp;
        p=p->next;

    }

}

void displaylist()
{
    struct node *temp;
    temp=head;

    while(temp!=NULL)
    {
        printf("\n%d",temp->data);
        temp=temp->next;
    }
}
int findmid()
{
    struct node *p,*q;
    p=head;
    q=head;

    while(q && q->next)
    {
        p=p->next;
        q=q->next->next;
    }
    return p->data;
}