单链表实现学生管理系统(头文件)

void PrintList(Node* headNode) { Node*pMove = headNode->next; //涉及到数据的处理 printf("学号\t姓名\t成绩\n"); while (pMove) { printf("%s\t%s\t%d\n", pMove->data.no, pMove->data.name, pMove->data.score); pMove = pMove->next; } printf("共有%d名学生\n", count); printf("\n