Sunteți pe pagina 1din 2

#include<iostream.

h>
#include<conio.h>
struct student
{
int rollno;
int marks;
student *next;
};
student* search (student *cptr,int mrollno);
void display(student *cptr);
void makelist(student *sptr);
void main()
{
clrscr();
char q;
int a;
student *strt,*ser_ptr;
strt= new student;
makelist(strt);
display(strt);
cout<<"Do you want to search some Data ...????";
cin>>q;
if(q=='y')
{ cout<<"Enter the Roll number to be searched";
cin>>a;
ser_ptr=search(start,a);
if(ser_ptr!=0)
{
cout<<"Found"<<endl;
cout<<"Marks"<<ser_ptr->marks;
}
else
cout<<"Not Found";
}
getch();
}
void makelist(student *sptr)
{
char more='y';
while (more=='y')
{
cout<<"Enter Roll number "<<endl;
cin>>sptr->rollno;
cout<<"Enter Marks "<<endl;
cin>>sptr->marks;
sptr->next=0;
cout<<"Any more Data y/n"<<endl;
cin>>more;
if(more =='y')
{
sptr->next=new student;
sptr=sptr->next;
}
}
}
void display(student *cptr)
{
clrscr();
cout<<"Roll No\t\t\t\t\tMarks"<<endl;
cout<<"........\t\t\t\t\t........"<<endl;
while(cptr!=0)
{
cout<<cptr ->rollno<<"\t"<<cptr ->marks<<endl;
cptr=cptr->next;
}
}
student* search(student*cptr,int mrollno)
{
while(cptr!=0)
{
if(cptr->rollno==mrollno)
return cptr;
else
cptr=cptr->next;
}
return cptr;
}

S-ar putea să vă placă și