c语言双向链表结点删除,数据结构双向链表的增删改查（c语言实现）

// 带头+双向+循环链表增删查改实现

typedef int LTDataType;

typedef struct ListNode

{

LTDataType _data;

struct ListNode* _next;

struct ListNode* _prev;

}ListNode;

1、创建返回链表的头结点

ListNode* ListCreate()

{

ListNode* head = (ListNode*)malloc(sizeof(ListNode));

head->next = head;

head->prev = head;

return head;

}

2、双向链表销毁

//双向链表销毁

void ListDestory(ListNode* phead)

{

ListNode* cur = phead->next;

while (cur != phead)

{

ListNode* next = cur->next;

free(cur);

cur = next;

}

free(phead);

phead = NULL;

}

3、动态申请一个新结点

ListNode* BuyListNode(LTDataType x)

{

ListNode* newnode = (ListNode*)malloc(sizeof(ListNode));

newnode->data = x;

newnode->next = NULL;

newnode->prev = NULL;

return newnode;

}

4、双向链表打印

//双向链表打印

void ListPrint(ListNode* phead)

{

ListNode* cur = phead->next;

while (cur != phead)

{

printf("%d", cur->data);

cur = cur->next;

}

printf("\n");

}

5、双向链表尾插

//双向链表尾插

void ListPushBack(ListNode* phead, LTDataType x)

{

ListNode* newnode = BuyListNode(x);

ListNode* tail = phead->prev;

tail->next = newnode;

newnode->prev = tail;

newnode->next = phead;

phead->prev = newnode;

}

6、双向链表尾删

//双向链表尾删

void ListPopBack(ListNode* phead)

{

ListNode* tail = phead->next;

ListNode* prev = tail->prev;

free(tail);

prev->next = phead;

phead->prev = prev;

}

7、双向链表头插

//双向链表头插

void ListPushFront(ListNode* phead, LTDataType x)

{

ListNode* newnode = BuyListNode(x);

ListNode* first = phead->next;

phead->next = newnode;

newnode->prev = phead;

newnode->next = first;

first->prev = newnode;

}

8、双向链表头删

//双向链表头删

void ListPopFront(ListNode* phead)

{

assert(phead->next != phead);

ListNode* first = phead->next;

ListNode* second = first->next;

free(first);

phead->next = second;

second->prev = phead;

}

9、 双向链表查找

//双向链表查找

ListNode* ListFind(ListNode* phead, LTDataType x)

{

ListNode* cur = phead->next;

while (cur != phead)

{

if (cur->data == x)

return cur;

cur = cur->next;

}

return NULL;

}

10、双向链表在pos的前面进行插入

//双向链表在pos的前面进行插入

void ListInsert(ListNode* pos, LTDataType x)

{

ListNode* prev = pos->prev;

ListNode* newnode = BuyListNode(x);

prev->next = newnode;

newnode->prev = prev;

newnode->next = pos;

pos->prev = newnode;

}

11、双向链表删除pos位置的结点

//双向链表删除pos位置的结点

void ListErase(ListNode* pos)

{

ListNode* prev = pos->prev;

ListNode*next = pos->next;

free(pos);

prev->next = next;

next->prev = prev;

}