LinkedList

LinkedList

 

#include <stdio.h>
#include <malloc.h>
#include <string.h>
#define EMPTY 0
 
struct node{
    int data;
    struct node *link;
};
typedef struct node linked;
 
linked * get_node()
{
    linked *tail;
    tail = (linked *)malloc(sizeof(linked));
    tail->link = EMPTY;
    return tail;
}
 
void insert_data(linked **head, int data)
{
    if (*head == NULL)
    {
        *head = get_node();
        (*head)->data = data;
    }
    else
    {
        insert_data(&(*head)->link, data);//재귀함수 사용(재귀함수 미사용시 반복문사용)
    }
}
 
void add(linked **head, int find_data, int add_data)
{
    if (*head == NULL)
    {
        printf("This data don't Exist");
    }
    else if ((*head)->data == find_data)
    {
        linked *add_node = EMPTY;
        add_node = get_node();
        add_node->data = add_data;
        add_node->link = (*head)->link;
        (*head)->link = add_node;
    }
    else
    {
        add(&(*head)->link, find_data, add_data);
    }
}
 
void delete_node(linked **head, int find_data)
{
    if (*head == NULL)
    {
        printf("This data don't Exist");
    }
 
    else if ((*head)->data == find_data)
    {
        linked * tmp;
        tmp = *head;
        //(*head)->link = (*head)->link;
        free(tmp);
    }
 
    else
    {
        delete_node(&(*head)->link, find_data);
    }
}
 
void print(linked *head)
{
    if (head == NULL)
    {
        printf("\n[Print Complete]\n");
    }
    else
    {
        printf("%d\t", head->data);
        print(head->link);
    }
}
 
void search()
{
}
 
void main()
{
    linked * head = EMPTY;
 
    insert_data(&head, 10);
    insert_data(&head, 20);
    insert_data(&head, 30);
 
    add(&head, 10, 15);
    add(&head, 22, 25);
 
    printf("--Linked List data print--\n");
    print(head);
 
}