[완료] 링크드리스트 전화번호부 짜봤습니다 한번 봐주실수있으실까요

#include <stdio.h>
 
typedef struct NodeLink{
	struct NodeLink* link; //싱글링크
	int p_number; //전화번호
	char* name; //이름
	char* email; //이메일
}NodeLink;
 
void show_menu()
{
	printf("\n----menu----");
	printf("\ninsert (1)\nremove (2)\nsearch (3)\ndisplay(4)\nexit   (5)\n");
	printf("------------\n");
}
 
//노드 초기화
void init(NodeLink* head)
{
	head->link = NULL;
}
 
//항목 추가
void insertNode(NodeLink* head, NodeLink* target)
{
	printf("%d\n", target->p_number);
	target->link = head->link;
	head->link = target;
	printf("\n	insulting success!!\n");
}
 
//항목 제거
void removeNode(NodeLink* head, NodeLink* target)
{
	NodeLink* p;
	NodeLink* tmp;
	for(p=head;p->link!=NULL;p=p->link){
		if(p->link->p_number==target->p_number){
			tmp = p->link->link;
			free(p->link->name);
			free(p->link->email);
			free(p->link);
			p->link = tmp;
			printf("\n	removing success!!\n");
			break;
		}
	}
	if(p==NULL){
		printf("\n	that number is not exist..\n");
	}
	free(target);
}
 
//항목 한개 출력. 직접사용할 수 없고 searchNode(),displayAll()에서 호출
void displayNode(NodeLink* head, NodeLink* target)
{
	printf("-----------------------\n");
	printf("Phone Number : 0%d\n", target->p_number);
	printf("Name : %s\n", target->name);
	printf("Email : %s\n", target->email);
	printf("-----------------------\n");
}
 
//저장되어있는 모든 항목 출력
void displayAll(NodeLink* head)
{
	int count=0;
	NodeLink* p;
	for(p=head->link;p!=NULL;p=p->link){
		displayNode(head, p);
	}
}
 
//전화번호로 항목 검색
void searchNode(NodeLink* head, NodeLink* target)
{
	NodeLink* p;
	for(p=head->link;p!=NULL;p=p->link){
		if(p->p_number==target->p_number){
			displayNode(head, p);
			break;
		}
	}
	if(p==NULL){
		printf("\n	that number is not exist..\n");
	}
	free(target);
}
 
//항목추가를 위해 사용자로부터 전화번호, 이름, 메일주소 입력
void input_inserting(NodeLink* target)
{
	target->name = (char*)malloc(30*sizeof(char));
	target->email = (char*)malloc(30*sizeof(char));
	if(target->name == NULL || target->email == NULL){
		printf("taking memory couldn't allowed\n");
		return ;	
	}
 
	printf("Phone Number : ");
	scanf("%d", &target->p_number);
	getchar();
	printf("Name : ");
	fgets(target->name, 30, stdin);
	*(target->name+strlen(target->name)-1)=NULL;
	printf("Email : ");
	fgets(target->email, 30, stdin);
	*(target->email+strlen(target->email)-1)=NULL;
}
 
//항목제거, 항목검색을 위한 전화번호 입력
void input_number(NodeLink* target)
{
	printf("Phone number : ");
	scanf("%d", &target->p_number);
	getchar();
}
 
int main(void)
{
	NodeLink* head = (char*)malloc(sizeof(char));
	NodeLink* target;
	char input=0;
 
	init(head);
 
	for(;;){
		show_menu();
 
		target = (NodeLink*)malloc(sizeof(NodeLink));
		if(target == NULL){
			printf("taking memory couldn't allowed\n");
			exit(1);
		}
		printf(">>");
		input = getchar();
		getchar(); 
		switch(input){
			case '1':
				printf("\n--inserting mode--\n");
				input_inserting(target); //사용자로부터 입력받은 값으로
							 //target노드설정
				insertNode(head,target); //설정된 target노드를 추가
				break;
			case '2':
				printf("\n--removing mode--\n");
				input_number(target); 	 //사용자로부터 입력받은 삭제할번호로
							 //target노드설정
				removeNode(head,target); //설정된 target노드 제거
				break;
			case '3':
				printf("\n--searching mode--\n");
				input_number(target); 	 //사용자로부터 입력받은 검색할번호로
							 //target노드 설정
				searchNode(head,target); //설정된 target노드 검색
				break;
			case '4':
				printf("\n--displaying mode--\n");
				displayAll(head);
				free(target);
				break;
			case '5':
				printf("\n--exit--\n\n");
				free(target);
				return 0;
			default :
				printf("\n	wrong number, try again\n");
				break;
		}
	}
	free(head);
}