| 42 | } /* End of main() */ |
| 43 | |
| 44 | void insert() |
| 45 | { |
| 46 | int add_item; |
| 47 | if (rear == MAX - 1) |
| 48 | printf("Queue Overflow \n"); |
| 49 | else |
| 50 | { |
| 51 | if (front == - 1) |
| 52 | /*If queue is initially empty */ |
| 53 | front = 0; |
| 54 | printf("Inset the element in queue : "); |
| 55 | scanf("%d", &add_item); |
| 56 | rear = rear + 1; |
| 57 | queue_array[rear] = add_item; |
| 58 | } |
| 59 | } /* End of insert() */ |
| 60 | |
| 61 | void delete() |
| 62 | { |