M 102 - Stacks Using a Linked List.c

#include "stdio.h"
#include "string.h"
#include "stdlib.h"
#include "math.h"

//BODY

int stackArr[100005];
int top = -1;// - Stores the index of the topmost element on the stack
void push(int x){
top++;
stackArr[top]=x;
} //- Insert an element onto the top of the stack
int peek(){
return stackArr[top];
} //- Returns the topmost element on the stack
void pop(){
stackArr[top]=NULL;
top--;
} //- Removes an element from the top of the stack
int empty(){
if(top==-1)
return 1;
else
return 0;
}// - Returns 1 if the stack is empty and 0 otherwise

//TAIL

int main()
{
    int n;
    top = -1;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        int t, x;
        scanf("%d", &t);
        if (t == 1) {
            scanf("%d", &x);
            push(x);
        }
        else if (t == 2) {
            if (empty()) {
                printf("Invalid\n");
            }
            else {
                pop();
            }
        }
        else if (t == 3){
            if (empty()) {
                printf("Invalid\n");
                continue;
            }
            for (int j = top; j >= 0; j--) {
                printf("%d ", stackArr[j]);
            }printf("\n");
        }
        else {
            if (empty()) {
                printf("Invalid\n");
                continue;
            }
            printf("%d\n", peek());
        }
    }
    return 0;
}