Reverse a Stack Using Recursion

1#include <stdio.h>
2#define MAX 100
3
4int stack[MAX];
5int top = -1;
6
7void push(int item) {
8    if (top < MAX - 1) {
9        stack[++top] = item;
10    }
11}
12
13int pop() {
14    if (top >= 0) {
15        return stack[top--];
16    }
17    return -1;
18}
19
20int isEmpty() {
21    return top == -1;
22}
23
24// Insert at bottom recursively
25void insertAtBottom(int item) {
26    if (isEmpty()) {
27        push(item);
28    } else {
29        int temp = pop();
30        insertAtBottom(item);
31        push(temp);
32    }
33}
34
35// Reverse stack using recursion
36void reverseStack() {
37    if (!isEmpty()) {
38        int temp = pop();
39        reverseStack();
40        insertAtBottom(temp);
41    }
42}
43
44void printStack() {
45    printf("Stack (top to bottom): ");
46    for (int i = top; i >= 0; i--) {
47        printf("%d ", stack[i]);
48    }
49    printf("\n");
50}
51
52int main() {
53    push(1);
54    push(2);
55    push(3);
56    push(4);
57    push(5);
58    
59    printf("Original ");
60    printStack();
61    
62    reverseStack();
63    
64    printf("Reversed ");
65    printStack();
66    
67    return 0;
68}