[개탱][자료구조][C언어][Linked_List][Single Linked List]

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <malloc.h>
#include <Windows.h>
struct Node
{
   int          data;
   struct Node* next;
};
 
int Insert(struct Node*root, int position);
int Delete(struct Node*root, int position);
int SetData(struct Node*root, int position, int data);
int GetData(struct Node*root, int position, int* data);
void print(struct Node* root);
 
#define ASSERT(exp) if(!(exp)){puts("Err\n");}
 
void main(void)
{
   struct Node* root =(struct Node*)calloc(1,sizeof(struct Node));
   root->next = NULL;
   int r,n;
 
   //0번위치에 10개 삽입
   for(int i=0;i<10;i++)
   {
      r = Insert(root, 0);ASSERT(r);
      r = SetData(root,0,i+1);ASSERT(r);
      
   }
   print(root);
   //삽입확인
   for(int i=0;i<10;i++)
   {
      r = GetData(root,i,&n);ASSERT(r);
      ASSERT(n == 10 - i);
   }
   print(root);
   //모두삭제
   for(int i=0;i<10;i++)
   {
      r = Delete(root, 0);ASSERT(r);
   }
   print(root);
   //마지막위치에 10개삽입
   for(int i=0;i<10;i++)
   {
      r = Insert(root,i);ASSERT(r);
      r = SetData(root,i,i+1);ASSERT(r);
   }
   print(root);
   //짝수번째모두삭제
   for(int i=10-1;i>=0;i-=2)
   {
      r = Delete(root, i);ASSERT(r);
   }
   print(root);
   //짝수번째다시삽입
   for(int i=1;i<10;i+=2)
   {
      r = Insert(root, i);ASSERT(r);
      r = SetData(root,i,i+1);ASSERT(r);
   }
   print(root);
   //복원확인
   for(int i=0;i<10;i++)
   {
      r = GetData(root,i,&n);ASSERT(r);
      ASSERT(n==i+1);
   }
   print(root);
   //에러확인
   for(int i=10;i<20;i++)
   {
      r = GetData(root,i,&n);ASSERT(!r);
   }
   print(root);
   //역순으로삭제
   for(int i=10-1;i>=0;i--)
   {
      r = Delete(root, i);ASSERT(r);
   }
   print(root);
 
   ASSERT(root->next == NULL);
   //delete root;
   free(root);
   root = NULL; //좋은습관
}
 
int Insert(struct Node*root, int position)
{
   struct Node* p_Cur = root;
   struct Node* p_New = (struct Node*)calloc(1,sizeof(struct Node*));
   if(!(p_New)) return 0;
   p_New->next = NULL;
   p_New->data = NULL;
   if(position == 0)
   {
      p_New->next = root->next;
      root->next = p_New;
   }else
   {
      for(int i = 0; i < position; i++)
      {
         if(p_Cur->next == NULL)   return 0;
         p_Cur = p_Cur->next;
      }
      p_New->next = p_Cur->next;
      p_Cur->next = p_New;
   }
   return 1;
}
int SetData(struct Node*root, int position, int data)
{
   struct Node* p_Cur = root->next;
   for(int i = 0; i < position; i++)
   {
      p_Cur = p_Cur->next;
   }
   (*p_Cur).data = data;
 
   if((*p_Cur).data)
      return 1;
   else
      return 0;
}
int GetData(struct Node*root, int position, int* data)
{
   struct Node* p_Cur = root->next;
   for(int i = 0; i < position; i++)
   {
      if(p_Cur->next == NULL) return 0;
      p_Cur = p_Cur->next;
   }
   *data = p_Cur->data;
   return 1;
}
int Delete(struct Node*root, int position)
{
   struct Node* p_Cur = root;
   struct Node* p_Con;
   for(int i = 0; i < position; i++)
   {
      if(p_Cur->next == NULL) return 0;
      p_Cur = p_Cur->next;
   }
   if(p_Cur->next != NULL)
    p_Con = p_Cur->next->next;
    else
        p_Con = NULL;
   //free(p_Cur->next);
   
    p_Cur->next = p_Con;
 
   return 1;
}
 
void print(struct Node* root)
{
   printf("\n");
   struct Node* cur;
   cur = root->next;
 
   while(cur!=NULL)
   {
      printf("%d ",cur->data);
      cur=cur->next;
   }
 
   Sleep(1000);
 
}