1. #include <iostream>
  2. using namespace std;
  3. #define SIZE 5
  4.  
  5. int queue_arr[SIZE];
  6. int front = -1;
  7. int rear = -1;
  8.  
  9. void insert_element(int value)
  10. {
  11.     if (rear == SIZE - 1)
  12. {
  13.         cout << "Queue Overflow" << endl;
  14.   }
  15.     else
  16.  {
  17.         if (front == -1)
  18.         {
  19.             front = 0;
  20.         }
  21.  
  22.         rear = rear + 1;
  23.         queue_arr[rear] = value;
  24.         cout << "Element Inserted Successfully" << endl;
  25.     }
  26. }
  27.  
  28. int main()
  29. {
  30.     int num;
  31.     cout << "Enter element to insert: ";
  32.     cin >> num;
  33.     insert_element(num);
  34.  
  35.     return 0;
  36. }