school/semester_2/programiranje_2/primeri/Example01c/Stack01c.cpp

#include "Stack01c.h"
#define EMPTY (-1)

Stack::Stack() {
    top=EMPTY;
}

void Stack::push(int n) {
    arr[++top] = n;
}

int Stack::pop() {
    return arr[top--];
}

int Stack::isEmpty() {
    return top == EMPTY;
}