#include #define MAX 101 int A[MAX]; int TOP = -1;//for empty void push(int x)//2,3,4 { if (TOP == MAX - 1) { printf("stack is full"); return; } TOP++;//0,1,2 A[TOP] = x; //2,3,4 } void pop() { if (TOP == -1) { printf("no element to pop"); return; } TOP--;//1 } int Top() { return A[TOP];//1 } void print() { int i; printf("Stack "); for (i = 0; i <= TOP; i++) { printf("%d ", A[i]); } printf("\n"); int a = Top();//2,3,4,1 printf("Top of the item : %d\n\n", a); } int main() { push(2); print(); push(3); print(); push(4); print(); pop(); print(); push(9); print(); }