CODE

#include
#include
#include
class node
{
public:
int no;
node *left,*next;
};
class list
{
public:
node *front,*rear;
list()
{
front=NULL;
}
void ibeg();
void iend();
void dbeg();
void dend();
void display();
};
void list::ibeg()
{
node *temp=new node;
cout<<"enter the element:";
cin>>temp->no;
if(front==NULL)
{
front=temp;
front->left=NULL;
rear=temp;
rear->next=NULL;
}
else
{
temp->next=front;
front->left=temp;
front=temp;
front->left=NULL;
}
}
void list::iend()
{
node *temp=new node;
cout<<"enter the data:";
cin>>temp->no;
if(front==NULL)
{
front=temp;
front->left=NULL;
rear=temp;
rear->next=NULL;
}
else
{
rear=front;
while(rear->next!=NULL)
rear=rear->next;
rear->next=temp;
temp->left=rear;
rear=temp;
rear->next=NULL;
}
}
void list::dbeg()
{
node *temp;
if(front==NULL)
cout<<" dq is empty"<else if(front==rear)
{
temp=front;
cout<<"deleted item:"<no<<"\n";
delete temp;
front=rear=NULL;
}
else
{
temp=front;
front=front->next;
cout<<"deleted item:"<no<<"\n";
delete temp;
}
}
void list::dend()
{
node *temp,*cur;
if(front==NULL)
cout<<"\ndq is empty\n";
else if(front==rear)
{
temp=front;
cout<<"deleted item:"<no<<"\n";
delete temp;
front=rear=NULL;
}
else
{
temp=front;
cur=front;
temp=front->next;
while(temp->next!=NULL)
{
cur=temp;
temp=temp->next;
}
rear=temp;
rear=cur;
cout<<"deleted item:"<no< rear->next=NULL;
}
}
void list::display()
{
node *temp;
if(front==NULL)
cout<<"dq is empty\n";
else
{
for(temp=front;temp!=NULL;temp=temp->next)
{
cout<<" "<no;
}
cout< }
}
void main()
{
list l;
int ch;
clrscr();
while(1)
{
cout<<"\n 1.ibeg 2.iend 3.dbeg 4.dend 5.display 6.exit";
cout<<"\nenter u r choice:";
cin>>ch;
switch(ch)
{
case 1:l.ibeg();
break;
case 2:l.iend();
break;
case 3:l.dbeg();
break;
case 4:l.dend();
break;
case 5:l.display();
break;
case 6:exit(0);
}
}
}