单链表类实现

《单链表类实现》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、线性表的链接存储结构——单链表的实现实验1、实验的名称：用类来实现单链表2、实验的功能：（1）建立单链表；（2）对已建立的单链表进行查找、插入、删除操作。3、实验的代码：#includeclasslist                            //定义单链表的结构{   public:      intnum,score;      charsex[10],name[10];      classlist*next;      voidcreate();      voidlistout

2、();      intseek(intn);      intinsert(intn);      voiddele(intn);};typedefclasslistnode;            //将classlist重定义为nodetypedefnode*link;                 //声明指针linkp,s;voidlist::create()                 //创建链表操作{      s=newnode;                     //建立一个新的结点      

3、cout<<"请输入学号、姓名、性别、成绩：";      cout<>s->num;      cin>>s->name;      cin>>s->sex;      cin>>s->score;      s->next=NULL;      p->next=s;      p=p->next;                     //工作指针p后移}voidlist::listout()               //进行输出操作{      while(p)      {    

4、         cout<next<<""<num<<""<name<<""<sex<<""<score<next;      }}intlist::seek(inti)              //进行查找操作{          intj=1;      while(p&&jnext;             j++;      }      if(!p)      {          

5、   cout<<"查找无效!";             cout<num<<""<name<<""<sex<<""<score;                    return1;      }}intlist::insert(inti)           //进行插入操作{      intj=0;      whil

6、e(p&&jnext;             j++;      }      if(!p)      {             cout<<"插入无效!";             cout<>s->num;             cin>>s

7、->name;             cin>>s->sex;             cin>>s->score;             s->next=p->next;             p->next=s;             return1;      }}voidlist::dele(inti)                 //进行删除操作{      intj=1;      while(p&&jnext;       j++;     

8、 }      if(!p)      {       cout<<"删除无效!";             cout<