node deletion in singly linked lists in C language

    #include<stdlib.h>
    #include<stdio.h>
    
    #define N 15
    
    typedef struct linklist
    {
    int data;
    struct linklist *next;
    }list, *plist;
    
    /*创建链表*/
    void create_list(plist* head)
    {
    int i;
    if (NULL == *head)/*若头为空，插入第一个元素1*/
    {
        plist phead = (plist)malloc(sizeof(list));
        phead->data = 1;
        phead->next = NULL;
        *head = phead;
    }
    for (i = 2; i < N + 1; i++)/*插入数据2~15*/
    {
        plist p = (plist)malloc(sizeof(list));
        p->data = i;
        p->next = *head;
        *head = p;
    }