Program to Implement queue using SLL

Code:
#include<iostream.h>
#include<conio.h>
#include<deque>
using namespace std;

void main()
{
int ch,val;
deque<int> dq;
deque<int>::iterator p;
cout<<”\n1.Inserting at front position\n2.Inserting at rear position”;
cout<<”\n3.Deleting front element\n4.Deleting rear element”;
cout<<”\n5.Display front element\n6.Display rear element\n7.Display whole deque”;
do
{
cout<<”\nEnter your choice:”;
cin>>ch;
switch(ch)
{
case 1:cout<<”\nEnter data:”;
cin>>val;
dq.push_front(val);
break;
case 2:cout<<”\nEnter data:”;
cin>>val;
dq.push_back(val);
break;
case 3:dq.pop_front();
break;
case 4:dq.pop_back();
break;
case 5:cout<<”\nFront:”;
cout<<dq.front();
break;
case 6:cout<<”\nRear:”;
cout<<dq.back();
break;
case 7: if(dq.empty())
cout<<”\nQueue is empty!”;
else
{
for(p=dq.begin();p<dq.end();p++)
cout<<” “<<*p;
}
break;
}
}while(ch!=8);
}