Implementing Stack
c_cpp
25 days ago
675 B
1
Indexable
Never
#include <stdio.h> #include <stdlib.h> struct stack { int size; int top; int *arr; }; int isEmpty(struct stack *ptr) { if (ptr->top == -1) { return 1; } else { return 0; } } int isFull(struct stack *ptr) { if (ptr->top == ptr->size - 1) { return 1; } else { return 0; } } int main() { // struct stack s; // s.size = 80; // s.top = -1; // s.arr = (int *) malloc(s.size * sizeof(int)); struct stack *s; s->size = 80; s->top = -1; s->arr = (int *)malloc(s->size * sizeof(int)); return 0; }