#include<iostream.h>
#include<conio.h>

struct node
{
int data;
node *next;
};

class linklist
{
private:
node *start;
node *current;

public:

linklist()
{
start=NULL;
current=NULL;
}

void insertnode(int n)
{
if(start==NULL)
{
start = new node;
start->data=n;
start->next=NULL;
}
else
{
current=start;
if(current!=NULL)
 {
  while(current->next!=NULL)
	{
	current=current->next;
	}
	current->next=new node;
	current=current->next;
	current->data=n;
	current->next=NULL;
 }
}
}

void deletee(int n)
{
node *curr=start;
node *prev;

if(start==NULL)
{
cout<<"Linked List already empty !!!!! "<<endl;
}
else;
if(curr->data==n)
{
start=curr->next;
delete curr;
}
else
{
while(curr->data!=n && curr!=NULL)
{
prev=curr;
curr=curr->next;
}
prev->next=curr->next; //store address of one more than next node in left one
delete curr;
}
}
void LRead(void)
{
while(start->next!=NULL)
{
cout<<start->data<<endl;
start=start->next;   //copy the address of next node in start
}
cout<<start->data;
}
};


void main(void)
{
clrscr();
linklist r;

r.insertnode(10);
r.insertnode(20);
r.insertnode(30);
r.insertnode(40);
r.insertnode(50);

r.deletee(10);
r.deletee(10);
r.deletee(20);
r.deletee(10);
r.deletee(50);
r.deletee(40);
r.deletee(10);
r.deletee(50);
r.deletee(10);
r.deletee(30);


r.deletee(10);
r.deletee(10);

r.LRead();

getch();
}