Array implementation of Queue in Data Structures
#include<stdio.h> #include<conio.h> #define SIZE 5 int front = – 1; int rear = – 1; int q[SIZE]; void insert( ); void del( ); void display( ); void main( ) { int choice; clrscr( ); do { printf(“\t Menu”); printf(“\n 1. Insert”); printf(“\n 2. Delete”); printf(“\n 3. Display “); printf(“\n 4. Exit”); printf(“\n Enter Your Choice:”); […]