Creating a circular singly linked list

/* Creating a circular singly linked list */
#include <stdio.h>
#include <malloc.h>

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

struct node *addToEmpty(int data)
{
    struct node *temp = malloc(sizeof(struct node));
    temp->data = data;
    temp->next = temp;
    return temp;
}

struct node *addAtEnd(struct node *tail, int data)
{
    struct node *newP = malloc(sizeof(struct node));
    newP->data = data;
    newP->next = NULL;

    newP->next = tail->next;
    tail->next = newP;
    tail = tail->next;
    return tail;
}

struct node* createList(struct node* tail)
{
    int i, n, data;
    printf("Enter the number of nodes of the linked list: ");
    scanf("%d", &n);

    if (n == 0)
        return tail;
    printf("Enter the element 1: ");
    scanf("%d", &data);
    tail = addToEmpty(data);

    for (i = 1; i < n; i++)
    {
        printf("Enter the element %d: ", i + 1);
        scanf("%d", &data);
        tail = addAtEnd(tail, data);
    }
    return tail;
}

void print(struct node* tail)
{
    if (tail == NULL)
        printf("No node in the list.");
    else
    {
        struct node* p = tail->next;
        do {
            printf("%d ", p->data);
            p = p->next;
        } while (p != tail->next);
    }
    printf("\n");
}

int main()
{
    struct node *tail;
    tail = createList(tail);
    print(tail);
    return 0;
}


/*
Output:
Enter the number of nodes of the linked list : 4
Enter the element 1 : 12
Enter the element 2 : 23
Enter the element 3 : 34
Enter the element 4 : 45
12 23 34 45
*/