用C语言实现一个有序链表,包括初始化,输入,输出,插入等操作
时间: 2023-05-12 20:05:52 浏览: 66
好的,以下是用C语言实现一个有序链表的代码:
```
#include <stdio.h>
#include <stdlib.h>
// 定义链表节点
typedef struct Node {
int data;
struct Node* next;
} Node;
// 初始化链表
void initList(Node** head) {
*head = NULL;
}
// 插入节点
void insertNode(Node** head, int data) {
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->data = data;
newNode->next = NULL;
if (*head == NULL || data < (*head)->data) {
newNode->next = *head;
*head = newNode;
} else {
Node* current = *head;
while (current->next != NULL && current->next->data < data) {
current = current->next;
}
newNode->next = current->next;
current->next = newNode;
}
}
// 输出链表
void printList(Node* head) {
Node* current = head;
while (current != NULL) {
printf("%d ", current->data);
current = current->next;
}
printf("\n");
}
// 释放链表内存
void freeList(Node** head) {
Node* current = *head;
while (current != NULL) {
Node* temp = current;
current = current->next;
free(temp);
}
*head = NULL;
}
// 测试代码
int main() {
Node* head;
initList(&head);
insertNode(&head, 3);
insertNode(&head, 1);
insertNode(&head, 2);
insertNode(&head, 5);
insertNode(&head, 4);
printList(head);
freeList(&head);
return 0;
}
```
这段代码实现了一个有序链表,包括初始化、插入、输出和释放内存等操作。