deque

#include<bits/stdc++.h>

using namespace std;
int main()
{
    deque<int>dq;
    deque<int>:: iterator it;
    int choice,item;
    while(1)
    {
        cout<<"\n....................";
        cout<<"Deque implemetation in stl\n";
        cout<<"\n....................";
        cout<<"1.Insert element at the end \n";
        cout<<"2.inter elmement at the front \n";
        cout<<"3.delet elmementr at the end\n  ";
        cout<<"4.delet elmementr at the front\n  ";
        cout<<"5.front element at deque";
        cout<<"6.last element at deque ";
        cout<<"7.size of the deque";



        //cout<"8.Display deque \n";

        cout<<"9.Eixit  \n";
        cout<<"Enter your choice :";
        cin>>choice;
        switch(choice)
        {
        case 1:
            cout<<"enter value to be inserter at the end:";
            cin>>item;
            dq.push_back(item);
            break;
        case 2:
            cout<<"enter value to be inserted at the front:";
            cin>>item;
            dq.push_front(item);
            break;
        case 3:
            item=dq.back();
            dq.pop_back();
            cout<<"Element "<<item<<"deleted"<<endl;
          break;
        case 4:
            item=dq.front();
            dq.pop_front();
            cout<<"deleted element is:"<<item;
              break;
        case 5:
            cout<<"front element is"<<dq.front()<<endl;
              break;
        case 6:
            cout<<"back or first element is:"<<dq.back()<<endl;
              break;
        case 7:
            cout<<"size of the  deque :"<<dq.size()<<endl;
              break;
        case 8:
            if(!dq.empty())
            {
                cout<<"all element of deque :";
              for(auto x: dq)
              {
                  cout<<x<<" ";
              }
              cout<<endl;

            }

         case 9:
            exit(1);
              break;
         default :
            cout<<"wrong choice "<<endl;
          }


    }
}