| 8 | struct node *rear=NULL; |
| 9 | |
| 10 | void Insert(){int item; |
| 11 | struct node *newNode; |
| 12 | newNode= (struct node *)malloc(sizeof(struct node)); |
| 13 | cout<<"Insert item in the queue"<<endl; |
| 14 | cin>>item; |
| 15 | newNode ->data=item; |
| 16 | newNode ->next=NULL; |
| 17 | if((front==NULL) && (rear==NULL)) |
| 18 | { |
| 19 | front = rear = newNode; |
| 20 | return; |
| 21 | } |
| 22 | rear->next=newNode; |
| 23 | rear= newNode; |
| 24 | |
| 25 | }} |
| 26 | |
| 27 | |
| 28 | void Delete(){ |