编辑“︁C 语言单链表”︁（章节）

== 核心操作 ==

=== 创建节点 ===
<syntaxhighlight lang="c">
#include <stdlib.h>

struct Node* createNode(int data) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    if (newNode == NULL) {
        printf("内存分配失败！");
        exit(1);
    }
    newNode->data = data;
    newNode->next = NULL;
    return newNode;
}
</syntaxhighlight>

=== 插入操作 ===

==== 头部插入 ====
<syntaxhighlight lang="c">
void insertAtHead(struct Node** head, int data) {
    struct Node* newNode = createNode(data);
    newNode->next = *head;
    *head = newNode;
}
</syntaxhighlight>

==== 尾部插入 ====
<syntaxhighlight lang="c">
void insertAtTail(struct Node** head, int data) {
    struct Node* newNode = createNode(data);
    
    if (*head == NULL) {
        *head = newNode;
        return;
    }
    
    struct Node* temp = *head;
    while (temp->next != NULL) {
        temp = temp->next;
    }
    temp->next = newNode;
}
</syntaxhighlight>

=== 删除操作 ===

==== 按值删除 ====
<syntaxhighlight lang="c">
void deleteNode(struct Node** head, int key) {
    struct Node *temp = *head, *prev = NULL;
    
    if (temp != NULL && temp->data == key) {
        *head = temp->next;
        free(temp);
        return;
    }
    
    while (temp != NULL && temp->data != key) {
        prev = temp;
        temp = temp->next;
    }
    
    if (temp == NULL) return;
    
    prev->next = temp->next;
    free(temp);
}
</syntaxhighlight>

=== 遍历链表 ===
<syntaxhighlight lang="c">
void printList(struct Node* node) {
    while (node != NULL) {
        printf("%d -> ", node->data);
        node = node->next;
    }
    printf("NULL\n");
}
</syntaxhighlight>

'''示例输出'''：
<pre>
10 -> 20 -> 30 -> NULL
</pre>