C语言链表--链表结点删除（4）

最新推荐文章于 2024-08-16 22:02:04 发布

Zoe Din

最新推荐文章于 2024-08-16 22:02:04 发布

阅读量1.8k

点赞数 4

分类专栏： C

本文链接：https://blog.csdn.net/naturly/article/details/105959273

版权

C 专栏收录该内容

118 篇文章 45 订阅

订阅专栏

1、

例子：删除中间结点3

要找到删除结点的前一个结点

struct node
{
    int data;
    struct node *next;
};
struct node *p,*q;
q = (struct node *)malloc(sizeof(struct node));
q = head -> next ;
p = q -> next;

q -> next = p -> next ;
free(p);

若没有指针P，只有q,那么

struct node
{
    int data;
    struct node *next;
};
struct node *q;
q = (struct node *)malloc(sizeof(struct node));
q = head -> next ;

q -> next = q -> next -> next ;
free(q->next);

(2) 删除头结点

struct node
{
    int data;
    struct node *next;
};  
struct node *p;  //定义指针p使其指向要删除的头结点
p = (struct node *)malloc(sizeof(struct node));
p = head  ;
haed = head -> next; //头指针下移
free(p);

（3）删除为结点

struct node
{
    int data;
    struct node *next;
};  
struct node *p;  //定义指针p使其指向要删除的头结点
p = (struct node *)malloc(sizeof(struct node));
p = q -> next  ;
q -> next = NULL ;  //删除尾结点

free(p);