#include<iostream.h>
#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
struct node{
struct node*prev;
int info;
struct node*next;
}*head,*p,*q,*temp;
struct node * createnode()
{
temp=new(struct node);
cout<<"Enter Info Part ";
cin>>temp->info;
temp->next=temp->prev=NULL;
return(temp);
}
void print_reverse()
{
struct node *i=head;
while(i->next!=NULL)
i=i->next;
struct node * tail = i;
cout <<endl<<"List is Reverse Order "<<endl;
while(tail->prev!=NULL)
{
cout<<tail->info<<" ";
tail=tail->prev;
}
cout<<tail->info;
}
void insert_beg()
{
temp=createnode();
if(head==NULL)
head=temp;
else
{
temp->next=head;
head->prev=temp;
head=temp;
}
}
void display()
{
struct node *i;
cout<<"My List is"<<endl;
for(i=head;i!=NULL;i=i->next)
cout<<i->info<<" ";
}
void search()
{
struct node *i;
int pos,ele,found=0;
cout<<"Enter element to search:";
cin>>ele;
pos=1;
for(i=head;i!=NULL;i=i->next,pos++)
{
if(i->info==ele)
{
cout<<"Element found at "<<pos<<endl;
found=1;
}
}
if(!found)
cout<<"Element not found"<<endl;
}
void reverse()
{
struct node *p,*q,*t;
p=head;
q=t=NULL;
while(p!=NULL)
{
q=p->next;
p->next=t;
t=p;
p=q;
}
head=t;
}
void insert_end()
{
struct node *i;
temp=createnode();
if(head==NULL)
head=temp;
else
{
for(i=head;i->next!=NULL;i=i->next)
;
i->next=temp;
temp->prev=i;
}
}
void insert_pos()
{
int j,pos;
struct node *i;
cout<<"At which position : " ;
cin>>pos;
temp=createnode();
i=head;
for(j=1;j<pos && i!=NULL;j++)
{
p=i;
i=i->next;
}
p->next=temp;
temp->prev=p;
temp->next=i;
i->prev=temp;
}
void delete_pos()
{
int pos;
cout<<"Enter Position:";
cin>>pos;
if(pos==1)
head=head->next;
else
{
p=head;
for(int i=1;i<pos;i++)
{
q=p;
p=p->next;
}
q->next=p->next;
(p->next)->prev=q;
}
}
void delete_last()
{
p=head;
while(p->next!=NULL)
{
q=p;
p=p->next;
}
q->next=NULL;
delete(p);
}
void main()
{
int choice;
clrscr();
do
{
cout<<endl<<"1:Insert at Begin"<<endl;
cout<<"2: Display"<<endl;
cout<<"3: Insert at end"<<endl;
cout<<"4: Insert at Position"<<endl;
cout<<"5: Delete at Position"<<endl;
cout<<"6: Delete Last"<<endl;
cout<<"7:Search the List"<<endl;
cout<<"8:Reverse the list"<<endl;
cout<<"9:Print Reverse Order"<<endl;
cout<<"10: Exit"<<endl;
cout<<"Enter your choice";
cin>>choice;
switch(choice)
{
case 1:insert_beg();break;
case 2:display();break;
case 3:insert_end();break;
case 4:insert_pos();break;
case 5:delete_pos();break;
case 6:delete_last();break;
case 7:search();break;
case 8:reverse();break;
case 9:print_reverse();break;
case 10:exit(0);
}
}while(choice!=10);
}