리스트로 구현한 스택

#include<stdio.h> #include<stdlib.h> typedef struct Node{ int data; struct Node *next; }Node; typedef struct Stack{ Node *top; }Stack; void init(Stack *stack); int IsEmpty(Stack *stack); void push(Stack *stack, int data); int pop(Stack *stack); void main(){ Stack stack; int tmp=0; init(&stack); push(&stack,1); push(&stack,2); push(&stack,3); push(&stack,4); push(&stack,5); while(!IsEmpty(&stack)){ tmp=pop(&stack); printf("%d ",tmp); } printf("\n"); return; } void init(Stack *stack){ stack->top = NULL; } int IsEmpty(Stack *stack){ return stack->top==NULL; } void push(Stack *stack, int data){ Node *New = (Node*)malloc(sizeof(Node)); New->data = data; New->next=stack->top; stack->top = New; } int pop(Stack *stack){ Node *tmp = (Node*)malloc(sizeof(Node)); int re=0; if(IsEmpty(stack)) return; tmp=stack->top; re=tmp->data; stack->top = tmp->next; free(tmp); return re; }