Notes

#include<iostream>
using namespace std;
struct node
{
int data;
node *next;
node()
{
next=NULL;
}
};

node* head=NULL;

void add_end(int y)
{
node *x=new node();
x->data=y;//cin>>x->data;
if(head==NULL)
head=x;
else
{
node *p=head;
while(p->next!=NULL)
p=p->next;
p->next=x;
}

}
void add_first(int y)
{
node *x=new node();
x->data=y;
x->next=head;
head=x;

}
void delete_first()
{
node *p=head;
head=head->next;
p->next=NULL;
delete p;

}

void delete_end()
{
node*p=head;
while(p->next->next!=NULL)
p=p->next;

delete p->next;
p->next=NULL;

}
void search(int y)
{
node *p=head;
if(head->data==y)
delete_first();
else
{
while(p->next->next!=NULL && p->next->data!=y)
p=p->next;
if(p->next->data==y)
{
if(p->next->next==NULL)
delete_end();
else
{ node *x=p->next;
p->next=p->next->next;
delete x;
}
}
else
cout<<"item not found"<<endl;

}


}
void main()
{
}