Static Implementation Of Stack

Static Implementation Of Stack

CODE

👇

1. #include <stdio.h>
2. #include <stdlib.h>
3. #define MAX 20
4. typedef struct 
5. {
6. int data[MAX];
7. int top;
8. }STACK;
9. 
   
10. void initstack(STACK *ps)
11. {
12. ps->top = -1;
13. }
14. 
    
15. void push(STACK *ps, int num)
16. {
17. ps->top++;
18. ps->data[ps->top] = num;
19. }
20. 
    
21. int pop(STACK *ps)
22. {
23. return(ps->data[ps->top--]);
24. }
25. 
    
26. int isempty(STACK *ps)
27. {
28. return(ps->top == -1);
29. }
30. 
    
31. int isfull(STACK *ps)
32. {
33. return(ps->top==MAX-1);
34. }
35. void main()
36. {
37. int n, choice;
38. STACK s1;
39. initstack(&s1);
40. do
41. {
42. printf("\n1.PUSH \n2.POP \n3.EXIT");
43. printf("\n Enter Your Choice:");
44. scanf("%d",&choice);
45. switch(choice)
46. {
47. case 1:
48. if(isfull (&s1))
49. printf("\n Stack Overflow");
50. else
51. {
52. printf("Enter the element to be pushed:");
53. scanf("%d", &n);
54. push(&s1, n);
55. }
56. break;
57. case 2:
58. if(isempty(&s1)==1)
59. printf("\n Stack Underflow");
60. else
61. printf("The popped element is: %d\n", pop(&s1));
62. break;
63. }
64. }
65. while(choice != 3);
66. }

👉Execute👈

//Output

/*

1.PUSH 

2.POP 

3.EXIT

 Enter Your Choice:1

Enter the element to be pushed:5

1.PUSH 

2.POP 

3.EXIT

 Enter Your Choice:2

The popped element is: 5

1.PUSH 

2.POP 

3.EXIT

 Enter Your Choice:3

*/

                                                                                         //ThE ProFessoR