c 单链表的一些操作

#include<stdio.h>
#include<stdlib.h>

typedef struct NODE /链表结构
{
int data;
struct NODE* next;
}Node;

void Initlinkedlist() /初始化
{
Node* head;
head = (Node*)malloc(sizeof(Node));
if (head == NULL)
{
printf(“mistake”);
EXIT_FAILURE;
}
else
head->next = NULL;
}

Node* Creat(int n) /创建一个链表
{
int x;
Node* head;
head = (Node*)malloc(sizeof(Node));
if (head == NULL)
EXIT_FAILURE;
else
{
head->next = NULL;
Node* tail;
tail = head;
printf(“输入”);
while (n–)
{
scanf_s("%d", &x);
Node* p;
p = (Node*)malloc(sizeof(Node));
if (p == NULL)
EXIT_FAILURE;
else
{
p->data = x;
tail->next = p;
tail = p;
}
}
tail->next = NULL;
return head;
}
}

void Output(Node* head) /输出
{
Node* p;
for (p = head->next; p != NULL; p = p->next)
printf("%d", p->data);
}

void Insert(Node** head, int x) /插入
{
Node* current, * new1;
while ((current = *head) != NULL && current->data < x)
head = &current->next;

new1 = (Node*)malloc(sizeof(Node));
if (new1 == NULL)
	EXIT_FAILURE;
else
{
	new1->data = x;
	new1->next = current;
	*head = new1;
}

}

void Del(Node**head,int del) /删除
{
Node* current;
while ((current = *head) != NULL && current->data != del)
head = &current->next;
if (current != NULL)
{
if (current->data == del)
{
*head = current->next;
free(current);
}
else
printf(“没有找到”);
}
}

int main()
{
int n, del, x;
Node* head;
Node** linkp;
Initlinkedlist();
printf(“输入长度”);
scanf_s("%d", &n);
head = Creat(n);
Output(head);
printf("\n插入");
scanf_s("%d", &x);
linkp = &head;
Insert(linkp, x);
Output(head);
printf("\n删除");
scanf_s("%d", &del);
Del(linkp, del);
Output(head);
return 0;
}