Dynamic Implementation of Circular Queue

Dynamic Implementation of Circular Queue 

CODE

👇

1. #include<stdio.h>
2. #include<stdlib.h>
3. 
   
4. typedef struct node
5. {
6. int info;
7.   struct node *next;
8. }NODE;
9. 
   
10. NODE *front,*rear;
11. 
    
12. void InitQ()
13. {
14.   rear = NULL;
15. }
16. 
    
17. void AddQ(int num)
18. {
19.   NODE *newnode;
20. newnode=(NODE*)malloc(sizeof(NODE));
21.   newnode->info=num;
22.   if(rear==NULL)
23.   {
24.     rear=newnode;
25.     rear->next=rear;
26.   }
27.   else
28.   {
29.     newnode->next=rear->next;
30.     rear->next=newnode;
31.     rear=newnode;
32.   }
33. }
34. 
    
35. int DelQ()
36. {
37. NODE *front=rear->next;
38.   int num=front->info;
39.   if(rear->next==rear)
40.   free(rear);
41.   else
42.   {
43.     rear->next=front->next;
44.     free(front);
45.   }
46.   return(num);
47. }
48. 
    
49. int isempty()
50. {
51.   return(rear == NULL);
52. }
53. 
    
54. void main()
55. {
56.   int choice,num;
57.   InitQ();
58.   printf(">>Dynamic Implementation of Circular Queue<<\n");
59.   do
60.   {
61.     printf("\n1: Add \n");
62.     printf("2: Delete \n");
63.     printf("3: Exit \n");
64.     printf("Enter your choice:\t");
65.     scanf("%d",&choice);
66. 
    
67.     switch(choice)
68.     {
69.       case 1: printf("Enter Element To Be Added:\t");
70.       scanf("%d",&num);
71.       AddQ(num);
72.       break;
73. 
    
74.       case 2: if(isempty())
75.       printf(">>Queue Is Empty<< \n");
76.       else
77.       printf("The Deleted Element Is:\t%d \n",DelQ());
78.       break;
79. 
    
80.       case 3: printf("\t>>END<<");
81.       break;
82.      
83.       default: printf("\t>>Enter Right Choice<<");
84.     }
85.   }
86. while(choice!=3);
87. }

👉Execute👈

//Output

/*

>>Dynamic Implementation of Circular Queue<<

1: Add

2: Delete

3: Exit

Enter your choice:      1

Enter Element To Be Added:      5

1: Add

2: Delete

3: Exit

Enter your choice:      2

The Deleted Element Is: 5

1: Add

2: Delete

3: Exit

Enter your choice:      4

        >>Enter Right Choice<<

1: Add

2: Delete

3: Exit

Enter your choice:      3

        >>END<<

*/

                                                    //ThE ProFessoR