1,2,3LINK LIST

#include<iostream.h>

#include<conio.h>

struct node

int d;

node *next;

};

class link

int size;

node *start;

public:

link()

start=NULL;

void create(int n)

int i;

node *item,*p;

size = n;

for(i=0;i<n;i++)

item = new node;

cout<<"enter node value";

cin>>item->d;

item->next = NULL;

if(start==NULL)

start = item;
 p = item;

else

p->next = item;

p = item;

void traverse()

int i;

node *item;

item = start;

for(i=0;i<size;i++)

cout<<item->d<<" ";

item = item->next;

void inspos()

node *item,*p;

int pos,n,i;

cout<<"\nenter position where to insert";

cin>>pos;

cout<<"\nenter what to enter";

cin>>n;

item = new node;

item->d=n;

item->next=NULL;
 p=start;

if(pos==0)

item->next=start;

start=item;

else

for(i=0;(i<pos-1);i++)

p=p->next;

item->next=p->next;

p->next=item;

size = size+1;

void insdata()

int s,n,i;

node *p,*item;

cout<<"\nenter after which data to insert";

cin>>s;

cout<<"enter what to insert";

cin>>n;

item= new node;

item->d = n;

item->next=NULL;

p = start;

for(i=0;i<size;i++)

{
 if(p->d==s)

item->next=p->next;

p->next=item;

break;

else

p=p->next;

size=size+1;

void del()

int n,i;

node *p,*prev;

cout<<"\nenter data which to delete";

cin>>n;

p=start;

if(start->d==n)

start=start->next;

else

for(i=0;i<size;i++)

if(p->d!=n)

prev = p;
 p=p->next;

else

prev->next=p->next;

size=size-1;

};

void main()

clrscr();

link a;

int n;

cout<<"enter how many numbers to enter";

cin>>n;

a.create(n);

a.traverse();

a.inspos();

a.traverse();

a.insdata();

a.traverse();

a.del();

a.traverse();

}
4

#include<iostream.h>

#include<conio.h>

struct node

int d;

node *next;

};

class link

int size;

node *start;

public:

link()

start=NULL;

void create(int n)

int i;

node *item,*p;

size = n;

for(i=0;i<n;i++)

item = new node;

cout<<"enter node value";

cin>>item->d;

item->next = NULL;

if(start==NULL)

{
 start = item;

p = item;

else

p->next = item;

p = item;

void traverse()

int i;

node *item;

item = start;

for(i=0;i<size;i++)

cout<<item->d<<" ";

item = item->next;

void search()

int i,n,j,f=0;

node *p;

p = start;

cout<<"\nenter element to search";

cin>>n;

for(i=0;i<size;i++)

if(p->d==n)
 {

for(j=2;j<n;j++)

if(n%j==0)

f=1;

break;

if(f==0)

cout<<"prime number";

break;

if(n%2!=0)

cout<<"odd number";

break;

else if(n%2==0)

cout<<"even number";

break;

else

p=p->next;

}
 }

};

void main()

clrscr();

int n;

cout<<"enter number of data to enter";

cin>>n;

link a;

a.create(n);

a.traverse();

a.search();

#include<iostream.h>

#include<conio.h>

struct node

int d;

node *next;

};

class link

{
int size;

node *start;

public:

link()

start=NULL;

void create(int n)

int i;

node *item,*p;

size = n;

for(i=0;i<n;i++)

item = new node;

cout<<"enter node value";

cin>>item->d;

item->next = NULL;

if(start==NULL)

start = item;

p = item;

else

p->next = item;

p = item;

void traverse()
 {

int i;

node *item;

item = start;

for(i=0;i<size;i++)

cout<<item->d<<" ";

item = item->next;

void sum()

int i,se=0,so=0;

node *p;

p = start;

for(i=0;i<size;i++)

if((p->d)%2==0)

se=se+(p->d);

else if(p->d%2!=0)

so=so+(p->d);

p=p->next;

cout<<"sum of even numbers "<<se;

cout<<"\nsum of odd numbers "<<so;

};
void main()

clrscr();

int n;

cout<<"enter number of data to enter";

cin>>n;

link a;

a.create(n);

a.traverse();

a.sum();