Skip to main content
SINGLE LINK LIST

Comments

Post a Comment

Popular posts from this blog

CIRCULAR-QUEUE Program /*circular-queue using array*/ #include<stdio.h> #include<stdlib.h> #define max 5 struct circular{     int item[max], rear; }c; int index; /*displaying circular queue*/ void display(){     if(c.rear == -1){         printf("\nCircular-Queue is empty");     }else{         printf("\nThe elements of Circular-Queue is: ");         for(index=0;index<=c.rear;index++){             printf("%d\t",c.item[index]);         }     } } /*inserting elements into circular-queue*/ void ins_que(){     int element;     if(c.rear == (max-1)){         printf("\nCircular-Queue is full");     }else{        ...
Post a Comment
Read more
Queue What is queue ? A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). program /*queue using array Fist-In-First-Out */ #include<stdio.h> #include<stdlib.h> #define max 5 struct queue{     int item[max], rear; }q; int index; /*displaying queue elements*/ void display(){     if(q.rear == -1){         printf("\nQueue is empty");     }else{         printf("\nThe queue elements is: ");         for(index=0;index<=q.rear;index++){             printf("%d\t",q.item[index]);         }     } } /*inserting elements into queue*/ void queue(){     int element;     if(q.rear == (max-1)){   ...
Post a Comment
Read more