C语言实现双向链表，增删改查，排序

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

typedef struct Node* NodePtr;

typedef struct Node
{
	int data;
	NodePtr prev;
	NodePtr next;
} Node;

void putPrev(int data, NodePtr head) {
	NodePtr node = (NodePtr)malloc(sizeof(Node));
	if (node==NULL)
	{
		printf("node==NUll");
		return;
	}
	node->data = data;
	node->next = NULL;
	node->prev = NULL;
	NodePtr p = head;
	while (p->prev!=NULL)
	{
		p = p->prev;
	}
	node->next = p;
	p->prev = node;
}

void putNext(int data, NodePtr head) {
	NodePtr node = (NodePtr)malloc(sizeof(Node));
	if (node == NULL)
	{
		printf("node==NUll");
		return;
	}
	node->data = data;
	node->next = NULL;
	node->prev = NULL;
	NodePtr p = head;
	while (p->next != NULL)
	{
		p = p->next;
	}
	node->prev = p;
	p->next = node;
}

//插入并排序
void putBySort(int data, NodePtr he