fork download
  1. #include <stdio.h>
  2.  
  3. #define SIZE 10
  4. struct stack {
  5. int myTop;
  6. int items[SIZE];
  7. };
  8. int empty(struct stack *s);
  9. int main() {
  10. struct stack s;
  11. s.items;
  12. s.myTop;
  13. int i;
  14. int x;
  15. for ( i = 0 ; i < SIZE ; i ++ ) {
  16. printf("enter you element");
  17. scanf("%d", &s.items[i]);
  18. }
  19. if (empty(&s))
  20. printf("stack is empty");
  21. else
  22. printf("stack is not empty");
  23.  
  24.  
  25. return 0;
  26. }
  27. int empty(struct stack*s) {
  28. if ( s->myTop == -1)
  29. return 1;
  30. else
  31. return 0;
  32. }
Success #stdin #stdout 0s 2160KB
stdin
Standard input is empty
stdout
enter you elemententer you elemententer you elemententer you elemententer you elemententer you elemententer you elemententer you elemententer you elemententer you elementstack is not empty