자료구조_c언어_배열스택_arrayStack_02

#include <stdio.h>
#include <stdlib.h>
 
#define MAX_STACK_SIZE 100
#define MAX_STRING 100
 
typedef struct {
    int student_no;
    char name[MAX_STRING];
    char address[MAX_STRING];
}element;
 
void push(element item);
element pop();
element stack[MAX_STACK_SIZE];
int top = -1;
 
int is_empty() {
    return(top == -1);
}
 
int is_full() {
    return (top == (MAX_STACK_SIZE - 1));
}
 
element peek() {
    if (is_empty()) {
        printf("스택 공백 에러\n    ");
        exit(1);
    }
    else
        return stack[top];
}
 
void push(element item) {
    if (is_full()) {
        printf("스택 포화 에러\n");
        exit(1);
    }
    else
        stack[++top] = item;
}
 
element pop() {
    if (is_empty()) {
        printf("스택 공백 에러\n");
        exit(1);
    }
    else
        return stack[top--];
}
 
int main() {
    element ie, ie2, oe;
    int i;
    strcpy(ie.name, "leesunsin");
    strcpy(ie.address, "korea/Seoul");
    ie.student_no = 20053001;
 
    strcpy(ie2.name, "leesunggya");
    strcpy(ie2.address, "korea");
    ie2.student_no = 20081002;
 
    push(ie);
    push(ie2);
 
    for (i = 0; i < 2; i++) {
        oe = pop();
        printf("name:%s\naddress:%s\nstudentNumber:%d\n", oe.name, oe.address, oe.student_no);
        printf("\n");
    }
 
    return 0;
}