线性表-通讯录的链表实现#C++

流程图：

代码：

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <fstream>
using namespace std;
int len = 0;
typedef struct stu
{
   
	char id[1001];
	char name[1001];
	char numb[1001];
	struct stu * next;
}stu , * link;
//声明 
void Save_stu(link L);//保存 
void Print_stu(link L);//输出单个节点 
void insert_stu(link head , int i);//添加 
void Delete_stu(link L);//删除 
void Show_Menu();//菜单 
void Exit();//退出 
void Search_stu(link L);//查找 
void Show_stu(link L);//显示 
void Clean_stu(link &L);//清除 
void Read_stu(link L);//读取 

void Read_stu(link L)
{
   
	ifstream in("student.txt");
	in.peek();
	if(in.is_open() && !in.eof())
	{
   
		link q = L;
		while(!in.eof())
		{
   
			link s = (stu *) malloc (sizeof(stu));
			in >> s -> id >> s -> name >> s -> numb;
			q -> next = s;
			s -> next = NULL