Dynamic Implemenatation Of Linear Queue

Dynamic Implemenatation Of Linear Queue

CODE

👇

1. #include <stdio.h>
2. typedef struct node
3. {
4. int info;
5. struct node *next;
6. }NODE;
7. 
   
8. NODE *front, *rear;
9. 
   
10. void initq()
11. {
12. front=rear=NULL;
13. }
14. 
    
15. int isempty()
16. {
17. return (front==NULL);
18. }
19. 
    
20. void addq(int num)
21. {
22. NODE *nn;
23. nn = (NODE*)malloc(sizeof(NODE));
24. nn->info=num;
25. nn->next=NULL;
26. if(front == NULL)
27. rear=front=nn;
28. else
29. {
30. rear->next=nn;
31. rear=nn;
32. }  
33. }
34. 
    
35. int removeq()
36. {
37. int num;
38. NODE *temp=front;
39. num = front->info;
40. front = front->next;
41. free (temp);
42. if(front==NULL)
43. rear=NULL;
44. return (num);
45. }
46. 
    
47. 
    
48. void main()
49. {
50. int choice, num;
51. initq();
52. printf(">>Dynamic Implementation Of Linear Queue<<");
53. do
54. {
55. printf("\n1.ADD \n2.DELETE \n3.EXIT\n");
56. printf("Enter Your Choice:\t");
57. scanf("%d", &choice);
58. switch(choice)
59. {
60. case 1:
61. printf("Enter The Element:\t");
62. scanf("%d",&num);
63. addq(num);
64. break;
66. case 2:
67. if(isempty())
68. printf("\n>>Queue Underflow<<");
69. else
70. printf("The Removed Element is:\t %d \n", removeq());
71. break;
73. case 3:
74. printf("\t>>END<<");
75. }
77. }while(choice!=3);
78. }

👉Execute👈

//Output

/*

>>Dynamic Implementation Of Linear Queue<<

1.ADD

2.DELETE

3.EXIT

Enter Your Choice:      1

Enter The Element:      5

1.ADD

2.DELETE

3.EXIT

Enter Your Choice:      2

The Removed 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 ProRessoR