用c语言代码写出单链表的基本操作?
时间: 2024-09-26 18:17:42 浏览: 14
在C语言中,单链表是一种基础的数据结构,它由节点组成,每个节点包含数据和指向下一个节点的指针。以下是实现单链表的一些基本操作:
1. **创建链表头结点** (InitList)
```c
typedef struct Node {
int data;
struct Node* next;
} Node;
Node* InitList() {
Node* head = (Node*)malloc(sizeof(Node)); // 分配内存
if (head) {
head->data = 0; // 初始化第一个节点的数据
head->next = NULL; // 链表开始为空
}
return head;
}
```
2. **插入元素到链表头部** (InsertAtHead)
```c
void InsertAtHead(Node** head, int value) {
Node* newNode = (Node*)malloc(sizeof(Node));
if (newNode) {
newNode->data = value;
newNode->next = *head;
*head = newNode;
} else {
printf("Memory allocation failed.\n");
}
}
```
3. **插入元素到链表尾部** (InsertAtTail)
```c
void InsertAtTail(Node** head, int value) {
Node* newNode = (Node*)malloc(sizeof(Node));
if (newNode) {
newNode->data = value;
if (*head == NULL) { // 如果链表为空,直接插入
*head = newNode;
} else {
Node* temp = *head;
while (temp->next != NULL) {
temp = temp->next;
}
temp->next = newNode;
}
} else {
printf("Memory allocation failed.\n");
}
}
```
4. **删除指定值的节点** (DeleteNode)
```c
void DeleteNode(Node** head, int value) {
Node* temp = *head;
Node* prev = NULL;
if (temp != NULL && temp->data == value) {
*head = temp->next; // 如果头节点是要删除的
free(temp);
return;
}
while (temp != NULL && temp->data != value) {
prev = temp;
temp = temp->next;
}
if (temp == NULL) return; // 要找的节点不存在
prev->next = temp->next;
free(temp);
}
```
5. **遍历并打印链表** (Traversal)
```c
void PrintList(Node* head) {
Node* current = head;
while (current != NULL) {
printf("%d ", current->data);
current = current->next;
}
printf("\n");
}
```