스택 연결리스트 메모리 누수

#include<stdio.h> #include<stdlib.h> #include<malloc.h> typedef int element; typedef struct link{ element data; struct link *link; }stack; typedef struct pstack{ stack *top; }thead; int is_empty(thead *s); void init(thead *s); void push(thead *s,element data); element pop(thead *s); element peek(thead *s); void display(thead *s); int main(void){ thead stack1; thead *p1 = &stack1; int i,n; init(p1); printf("숫자너어라\n"); scanf("%d",&n); for(i = 0; i<n ; i++){ push(p1,i+((n))); } display(p1); return 0; } void init(thead *s){ s -> top = NULL; } int is_empty(thead *s){ return (s->top == NULL); } void push(thead *s, element data){ stack *temp = (stack *)malloc(sizeof(stack)); if(!temp){ fprintf(stderr,"FUCKING MEMORY LEAKING"); return; } else{ temp ->data = data; temp -> link = s -> top; s->top = temp; } } element pop(thead *s){ stack *temp = s->top; if(!temp){ fprintf(stderr,"M"); exit(1); } else{ temp->link = s->top->link; s->top = temp; } return temp -> data; } element peek(thead *s){ stack *temp = s->top; if(!temp){ fprintf(stderr,"MEMORY AKAKAKKAK"); exit(1); } else{ return temp->data; } } void display(thead *s){ stack *temp = s->top; if(!temp){ fprintf(stderr,"mMEEOD...OTL"); return; } else{ while(temp != NULL){ printf("%d->",temp ->data); temp = temp->link; } } }