#include <stdio.h> #define MAX 5 int stack[MAX]; int top = -1; void push(int value) { if (top == MAX - 1) { printf("Stack is full!\n"); return; } top++; stack[top] = value; } int pop() { if (top == -1) { printf("Stack is empty!\n"); return -1; } int value = stack[top]; top--; return value; } int peek() { if (top == -1) { printf("Stack is empty!\n"); return -1; } return stack[top]; } // Returns 1 (true) if the stack is empty int isEmpty() { return top == -1; } int main() { push(10); push(20); push(30); printf("Top item: %d\n", peek()); // Pop items until the stack is empty while (!isEmpty()) { printf("Popped: %d\n", pop()); } return 0; }