링크드리스트 프로그래밍~...ReadFile() 오류부분 왜 그럴까요? 고수님들 해결부탁드려요~

음... 다른 건 잘 되는데 ReadFile()함수 파일에서 받아오기 하면 왜 안될까요?

ㅡㅡ;

#include
#include
#include
#include
#include

typedef struct _Node {
int KEY;
char NAME[10];
struct _Node *next;
} NODE;

NODE *head, *end;
void PrintTitle(void);
void PrintMenu(void);
void InputMenu(void);
void InitializeNode(void);
void InsertNode(NODE *);
void InsertNode2(int, char**);
void DeleteNode(NODE *);
void PrintNode(void);
void SearchNode(NODE *);
void ReadFile(char*);
void WriteFile(char*);
void Cleanup(void);

int main(void)
{

int i;
PrintTitle();
InitializeNode();

while(1)
{
PrintMenu();
InputMenu();
}

}

void PrintTitle(void)
{
printf("\n\n****************************************\n");
printf("** **\n");
printf("** Linked List test **\n");
printf("** **\n");
printf("** **\n");
printf("****************************************\n\n\n");
}

void PrintMenu(void)
{

printf("\n\n\n0. Initialize Node\n");
printf("1. Insert Node\n");
printf("2. Delete Node\n");
printf("3. Print Node\n");
printf("4. Search Node\n");
printf("5. Read File\n");
printf("6. Write File\n");
printf("Q. Quit Program\n");
printf("Input the number please : ");
}

void InputMenu(void)
{
char i;
char fname[50];
NODE *ptr;
ptr=(NODE*)malloc(sizeof(NODE));

i=getchar();

switch (i)
{
case '0' :
Cleanup();
InitializeNode();
printf("Node is cleaned\n");
PrintNode();
break;

case '1' :
PrintNode();
printf("Input the KEY and Name : ");
if(scanf("%d%s", &ptr->KEY, ptr->NAME)==2)
{
InsertNode(ptr);
PrintNode();
break;
}
else
{
printf("Usage : (int)KEY (string)NAME\n\n");
break;
}

case '2' :
PrintNode();
printf("Input the KEY :");
scanf("%d", &ptr->KEY);
DeleteNode(ptr);
PrintNode();
break;

case '3' :
PrintNode();
break;

case '4' :
printf("Input the NAME : ");
scanf("%s", ptr->NAME);
SearchNode(ptr);
break;

case '5' :
Cleanup();
InitializeNode();
printf("Input the FILENAME :");
scanf("%s",fname);
ReadFile(fname);
break;

case '6' :
printf("Input the FILENAME :");
scanf("%s",fname);
WriteFile(fname);
break;

case 'Q' :
printf("\nThanks! Good bye!\n\n");
exit(0);
break;

default :
break;
}

}

void InitializeNode(void)
{
head=(NODE*)malloc(sizeof(NODE));
end=(NODE*)malloc(sizeof(NODE));
head->next=end;
end->next=end;
}

void InsertNode(NODE *ptr)
{
NODE *indexptr;

for(indexptr=head; indexptr!=(end);indexptr=indexptr->next)
{
if(indexptr->next==end)
{
ptr->next=indexptr->next;
indexptr->next=ptr;
printf("\n\tKEY %d\tNode %s is inserted!!\n", ptr->KEY,ptr->NAME);
break;
}

else if(indexptr->next->KEY > ptr->KEY)
{
ptr->next=indexptr->next;
indexptr->next=ptr;
printf("\n\tKEY%d\tNode %s is inserted!!\n", ptr->KEY,ptr->NAME);
break;
}
}
}

void DeleteNode(NODE *ptr)
{
NODE *indexptr;
NODE *deleteptr;

for (indexptr=head; indexptr!=end;indexptr=indexptr->next)
if(indexptr->next->KEY == ptr->KEY) {
deleteptr=indexptr->next;
break;
}

printf("\n%d Node : %s is deleted!!", deleteptr->KEY,deleteptr->NAME);
indexptr->next=indexptr->next->next;
free(deleteptr);
}

void PrintNode(void)
{
NODE *indexptr;
printf("\n\tKEY \tNAME\n");
printf("\t--------------------\n");

for(indexptr=head->next; indexptr!=end;indexptr=indexptr->next)
{
printf("\t%-2d \t%-2s\n",indexptr->KEY, indexptr->NAME);
}
printf("\n");

}

void SearchNode(NODE *ptr)
{
NODE *indexptr;
for(indexptr=head; indexptr!=end; indexptr=indexptr->next)
{
if (strcmp(indexptr->next->NAME, ptr->NAME)==0)
{
printf("%s's is located in this Linked List.\nKEY number is %d.\n\n",indexptr->next->NAME, indexptr->next->KEY);
break;
}
else
{
printf("%s's is NOT located in this Linked List.\n\n",ptr->NAME);
break;
}

}
}

void ReadFile(char fname[])
{
NODE *ptr;
ptr=(NODE*)malloc(sizeof(NODE));
FILE *fp;
int i=1;

fp=fopen(fname,"r");
if(!fp)
{
fprintf(stderr,"Error : couldn't read %s file\n",fname);
exit(1);
}
while(fscanf(fp, "%d %sn", &ptr->KEY, ptr->NAME)!=EOF){
InsertNode(ptr);
printf("\t%d %s\n", ptr->KEY, ptr->NAME);
}
fclose(fp);
printf("\n%s File is read!!", fname);
}

void WriteFile(char fname[])
{
NODE *indexptr;
FILE *fp;

fp=fopen(fname,"w");
if (!fp)
{
fprintf (stderr, "Error: couldn't write %s file\n", fname);
exit(1);
}

for (indexptr=head->next;indexptr!=end;indexptr=indexptr->next)
fprintf(fp,"%d %s\n",indexptr->KEY,indexptr->NAME);

fclose(fp);
printf("\n%s File is wrote!!", fname);
}

void Cleanup(void)
{
NODE *indexptr;
NODE *deleteptr;

for(indexptr=head->next;indexptr!=end;indexptr=indexptr->next)
{
deleteptr=indexptr;
head->next=indexptr->next;
printf("KEY : %d\tNAME : %s CLEANED\n",deleteptr->KEY, deleteptr->NAME);
free(deleteptr);

}
free(head);
free(end);

}