queue insertion deletion using array cpp c++ program
#include <iostream> using namespace std ; int queue [ 100 ], n = 100 , front = - 1 , rear = - 1 ; void Insert () { int val ; if ( front == - 1 ) front = 0 ; cout << "Insert the element in queue : " << endl ; cin >> val ; rear ++; queue [ rear ] = val ; } } void Delete () { cout << "Element deleted from queue is : " << queue [ front ] << endl ; front ++;; } } void Display () { cout << "Queue elements are : " ; for ( int i = front ; i <= rear ; i ++) cout << queue [ i ]<< " " ; cout << endl ; } } int main () { int ch ; cout << "1) Insert element to queue" << endl ; cout << "2) Delete element from queue" << endl ; cout << "3) Display all the elements of queue" &l