deq

#include <iostream>
#include <list>
using namespace std;

class listqueue
{
 private:
 list <int> lst;
 public:
 void enqueue(int item)
 {
  lst.push_back(item);
  cout<<item<<“pushed into the list”<<endl;
  }
  void enqueue1(int item)
  {
   lst.push_front(item);
   cout<<item<<“pushed into the list”<<endl;
  }
  void dequeue()
  {
   if(!lst.empty())
   cout<<“item popped”<<lst.front();
   lst.pop_front();
  }
  void dequeue1()
  {
   if(!lst.empty())
   cout<<“item popped”<<lst.back();
   lst.pop_back();
  }
  void display()
  {
   for(list <int>::iterator itr1=lst.begin();itr1 !=lst.end();itr1++)
   cout<<*itr1<<“–>”;
  }

  };
  int main()
  {
  listqueue lst;
  int choice;
  int item;
  while(1)
  {
   cout<<“\n 1.enqueue \n 2.enqueue1 \n 3.dequeue \n 4.dequeue1 \n 5.display \n”<<endl;
   cout<<“\n enter your choice”<<endl;
   cin>>choice;
   switch(choice)
   {
    case 1:
    cout<<“enter the item”<<endl;
    cin>>item;
    lst.enqueue(item);
    break;
    case 2:
    cout<<“enter the item”<<endl;
    cin>>item;
    lst.enqueue1(item);
    break;
    case 3:
    lst.dequeue();
    break;
    case 4:
    lst.dequeue1();
    case 5:
    lst.display();
    break;
    default : cout<<“invalid choice”<<endl;
   }
  }
  return 0;
}

Paste text,images,html and share with anyone
Scroll to Top