请编写程序实现链表的建立、插入、删除、遍历的基本运算,其中顺序表中每一个数据元素的类型定义为学生信息的结构体,包括学号、姓名和成绩。
时间: 2023-05-19 14:01:26 浏览: 39
好的,以下是链表的建立、插入、删除、遍历的基本运算的代码实现:
```c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// 定义学生信息的结构体
typedef struct student {
int id; // 学号
char name[20]; // 姓名
float score; // 成绩
struct student *next; // 指向下一个节点的指针
} Student;
// 创建链表
Student *createList() {
Student *head = (Student *)malloc(sizeof(Student));
head->next = NULL;
return head;
}
// 插入节点
void insertNode(Student *head, int id, char *name, float score) {
Student *newNode = (Student *)malloc(sizeof(Student));
newNode->id = id;
strcpy(newNode->name, name);
newNode->score = score;
newNode->next = NULL;
Student *p = head;
while (p->next != NULL) {
p = p->next;
}
p->next = newNode;
}
// 删除节点
void deleteNode(Student *head, int id) {
Student *p = head;
while (p->next != NULL) {
if (p->next->id == id) {
Student *temp = p->next;
p->next = temp->next;
free(temp);
return;
}
p = p->next;
}
}
// 遍历链表
void traverseList(Student *head) {
Student *p = head->next;
while (p != NULL) {
printf("学号:%d,姓名:%s,成绩:%.2f\n", p->id, p->name, p->score);
p = p->next;
}
}
int main() {
Student *head = createList();
// 插入节点
insertNode(head, 1001, "张三", 89.5);
insertNode(head, 1002, "李四", 92.0);
insertNode(head, 1003, "王五", 85.5);
// 遍历链表
traverseList(head);
// 删除节点
deleteNode(head, 1002);
// 遍历链表
traverseList(head);
return 0;
}
```
希望这个代码能够帮到你!
阅读全文