queueusingclass.cpp

A queue data structure implementation using class.

Author: souravmondaldev

Queue/queueusingclass.cpp

@@ -0,0 +1,95 @@
+#include <iostream>
+#define MAX 10
+
+using namespace std;
+
+class Queue
+{
+      int front,rear;
+      int queue[MAX];
+      //int item;
+ 
+      public:
+  
+      Queue()
+      {
+              front=rear=-1;
+      }
+ 
+       void qinsert(int item)
+       {
+              if(rear==MAX-1)
+             {
+                      cout<<"\nQUEUE OVERFLOW";
+             }
+             else if(front==-1 && rear==-1)
+             {
+                      front=rear=0;
+                     // cin>>item;
+                      queue[rear]=item;
+                      cout<<"\nITEM INSERTED: "<<item;
+             }
+             else
+             {
+                      rear++;
+                      queue[rear]=item;
+                      cout<<"\nITEM INSERTED: "<<item;
+             }
+       }
+  
+       void qdelete()
+       {
+              int item;
+  
+              if(rear==-1)
+             {
+                       cout<<"\nQUEUE UNDERFLOW";
+             }
+             else if(front==0 && rear==0)
+             {
+                       item=queue[front];
+                       front=rear=-1;
+                       cout<<"\n\nITEM DELETED: "<<item;
+             }
+             else
+             {
+                      item=queue[front];
+                      front++;
+                      cout<<"\n\nITEM DELETED: "<<item;
+             }
+       }
+ 
+       void qtraverse()
+       {
+              if(front==-1)
+              {
+                      cout<<"\n\nQUEUE IS EMPTY\n";
+              }
+              else
+              {
+                      cout<<"\n\nQUEUE ITEMS\n";
+                      for(int i=front;i<=rear;i++)
+                      {
+                               cout<<queue[i]<<" ";
+                      }
+                      cout<<endl;
+              }
+        }
+};
+
+int main()
+{
+      Queue q;
+ 
+      q.qtraverse();
+      q.qinsert(10);
+      q.qinsert(25);
+ 
+      q.qtraverse();
+ 
+      q.qdelete();
+      q.qinsert(30);
+ 
+      q.qtraverse();
+      return 0;
+}