如果（P！||！（* P））
       返回;
    结构*人TMP;
    TMP =（* P）;
    （* P）=（* P） - ＆gt;接着，
    免费（TMP）;
    返回;无效delend（结构人** P）//删除结束
{
    如果（P！||！（* P））
        返回;
    如果（！（* P） - ＆gt;接着）
    {
        * p值= NULL;
    }
    结构*人TMP，*米;
    TMP = * P;
    而（tmp-＆GT;下一步 - ＆GT;！下次= NULL）
    {
        TMP = tmp-＆gt;接下来，
    }
    免费（tmp-＆gt;下面）;
    tmp-＆gt;接着= NULL;
    返回;}
 

struct person 
{
    int age;
    char name[100];
    struct person *next;
};

void delfirst(struct person **p)// For deleting the beginning
{
    struct person *tmp,*m;
    m = (*p);
        tmp = (*p)->next;
    free(m);
    return;

}
void delend(struct person **p)// For deleting the end
{
    struct person *tmp,*m;
    tmp=*p; 
    while(tmp->next!=NULL)
    {
        tmp=tmp->next;
    }
    m->next=tmp;
    free(tmp);
    m->next = NULL;
    return;

}

I'm looking for two separate functions to delete the first and last elements of a linked list. Here is what I tried. What do you suggest? Especially deleting first is so problematic for me.

    if (!p || !(*p))
       return;
    struct person *tmp;
    tmp = (*p);
    (*p) = (*p)->next;
    free(tmp);
    return;

void delend(struct person **p)// For deleting the end
{
    if (!p || !(*p))
        return;
    if (!(*p)->next)
    {
        *p = NULL;    
    }
    struct person *tmp,*m;
    tmp=*p; 
    while(tmp->next->next!=NULL)
    {
        tmp=tmp->next;
    }
    free(tmp->next);
    tmp->next = NULL;
    return;

}