Types of queues in data structure

[@rightclick80]

Code ============================ #include #include #include # define MAX 100 struct PQ { int val; int pri; }; struct PQ que[MAX]; int r = - 1,f = - 1, t; void enque(struct PQ n) { if (f < MAX - 1) { if (f == -1 && r == -1) // First Item f++; t=r; while(t>=f && que[t].pri