/*-----------------------------------------------------------------------------------------
* Project Name   : Report03 - Linkedlist
* Programmed by  : Young Min Jo
* Student Number : 2008060021
* Date           : Wednesday 19 Mar 2014
* (c) Copyright by Department of Computer Education at Chungbuk
*     National University, Chungbuk, Republic of Korea
------------------------------------------------------------------------------------------*/
#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>

//구조체 정의
typedef struct node{
	int data;
	node *link;
}node;

/*-------------------------------- Retrieve_Linkedlist ------------------------------------
/* Function : 탐색
------------------------------------------------------------------------------------------*/
node *Retrieve_Linkedlist(node *Linkedlist, int input){

	node *temp;
	temp = Linkedlist;

	while (temp != NULL){
		if (temp->data == input){
			return temp;
		}
		temp = temp->link;
	}
	return temp;
}

/*-------------------------------------- Insert -------------------------------------------
/* Function : 삽입
------------------------------------------------------------------------------------------*/
void Insert_Linkedlist(node **Linkedlist, int input){

	node *temp;
	node *newnode;

	if (*Linkedlist == NULL){
		temp = (node*)malloc(sizeof(node));
		temp->data = input;
		temp->link = NULL;
		*Linkedlist = temp;
	}
	else {
		temp = *Linkedlist;
		//첫 노드 데이터 와 input 크기 비교
		if (temp->data > input){
			newnode = (node*)malloc(sizeof(node));
			newnode->data = input;
			newnode->link = temp;
			*Linkedlist = newnode;
		}
		else{
			while (temp->link != NULL){
				//다음 노드 데이터 크기와 input 비교
				if (temp->link->data > input){
					break;
				}
				temp = temp->link;
			}
			//input 보다 큰 수가 없을 경우
			if (temp->link == NULL){
				temp->link = (node*)malloc(sizeof(node));
				temp = temp->link;
				temp->data = input;
				temp->link = NULL;
			}
			//노드 사이에 input 값이 들어갈 경우
			else{
				newnode = (node*)malloc(sizeof(node));
				newnode->data = input;
				newnode->link = temp->link;
				temp->link = newnode;
			}
		}
	}
}


/*------------------------------ Delete_Linkedlist ----------------------------------------
/* Function : 삭제
------------------------------------------------------------------------------------------*/
void Delete_Linkedlist(node **Linkedlist, int input){

	node *temp;
	node *check = Retrieve_Linkedlist(*Linkedlist, input);

	temp = *Linkedlist;
	if (check == NULL){
		printf("삭제할 데이터가 존재하지 않습니다.\n");
	}
	else{
		printf("%d 삭제 완료.\n", input);
		if (temp == check){
			temp = temp->link;
			*Linkedlist = temp;
		}
		else{
			while (temp->link != check){
				temp = temp->link;
			}
			temp->link = check->link;
		}
	}
}

/*------------------------------- Print_Linkedlist ----------------------------------------
/* Function : 저장된 자료 출력
------------------------------------------------------------------------------------------*/
void Print_Linkedlist(node *Linkedlist){

	node *temp;
	temp = Linkedlist;

	while (temp != NULL){
		printf("%d\n", temp->data);
		temp = temp->link;
	}
}

/*--------------------------------------- Menu --------------------------------------------
/* Function : 메뉴
------------------------------------------------------------------------------------------*/
void Menu(){
	printf("****Linkedlist Menu****\n");
	printf("1. Retrieve\n");
	printf("2. Insert\n");
	printf("3. Delete\n");
	printf("4. Print\n");
	printf("5. Exit\n\n");
}

void main(){

	int menu;
	int input;
	node *Linkedlist = NULL;
	node *check;

	while (1){
		Menu();
		printf("메뉴번호 : ");
		scanf("%d", &menu);

		if (menu == 1){
			printf("\n***Retrieve***\n");
			printf("검색 데이터 : ");
			scanf("%d", &input);
			check = Retrieve_Linkedlist(Linkedlist, input);
			if (check != NULL){
				printf("***검색 결과***\n");
				printf("%d\n\n", check->data);
			}
			else{
				printf("검색 실패\n\n");
			}
		}
		else if (menu == 2){
			printf("\n***Insert***\n");
			printf("삽입 데이터 : ");
			scanf("%d", &input);
			Insert_Linkedlist(&Linkedlist, input);
			printf("\n");
		}
		else if (menu == 3){
			printf("\n***Delete***\n");
			printf("삭제 데이터 : ");
			scanf("%d", &input);
			Delete_Linkedlist(&Linkedlist, input);
		}
		else if (menu == 4){
			printf("****Print_Linkedlist****\n");
			Print_Linkedlist(Linkedlist);
			printf("\n");
		}
		else if (menu == 5){
			exit(0);
		}
		else{
			printf("메뉴번호를 다시입력해주세요\n");
		}
	}
}