node max->min

//实现在输入时自动排序（由小到大）

#include 
#include 
#include 


typedef void(*backcall)(void *);
typedef struct node
{
	backcall fun;
	void* userdata;
	int data;
	struct node *next;
	
}PNode;
PNode head={0};
void list_printf(PNode *head)
{
	PNode *p=head->next;
	while(p!=NULL)
	{
		printf("data:%d\n",p->data);
		p=p->next;
	}
	//printf("data:%d\n",p->data);
	printf("\n");
}
void list_delate(PNode *head)
{
	printf("delate list\n");
	PNode *p=head;
	PNode *temp=p;
	if(p->next==NULL)
		return;
	while(p->next!=NULL)
	{
		//printf("delate data:%d\n",p->data);
		temp=p;
		p=p->next;
		//printf("delate data:%d\n",p->data);
	}
	printf("delate data:%d\n",p->data);
	free(p);
	p=NULL;
	temp->next=NULL;
}
PNode* get_node(PNode *head)
{
	if(head==NULL||head->next==NULL)
		return NULL;
	return head->next;
}
int  add_node(PNode *head,PNode *new)
{
	int data=new->data;
	PNode *p=head->next;
	PNode *temp=head;
	PNode *node=(PNode*)malloc(sizeof(PNode));
	if(node==NULL)
	{
		printf("malloc node fail\n");
		return -1;
	}else{
		
		node->next=NULL;
		node->data=data;
		node->fun=new->fun;
		node->userdata=new->userdata;
		
	}
	/*while(p!=NULL&&data>p->data)
	{
		printf("temp->data;%d\n",temp->data);
		temp=p;
		p=p->next;
	}
	if(p==NULL)
	{
		temp->next=node;
		node->next=NULL;
	}
	else
	{
		temp->next=node;
		node->next=p;
	}*/
	printf("input:%d\n",data);
	while(p!=NULL&&datadata)
	{
		temp=p;
		printf("temp->data;%d\n",temp->data);
		p=p->next;
	}
	if(p==NULL)
	{
		printf("null temp->data;%d\n",temp->data);

		temp->next=node;
		node->next=NULL;
	}
	else
	{
		printf("llllll temp->data;%d\n",temp->data);
		temp->next=node;
		node->next=p;			
	}
	return 0;
} 
void callp(void *param)
{
	printf("%s\n",(char *)param);
}
void nodecall(void *param)
{
	PNode* node=(PNode*)param;
	printf("this is node test\n");
	printf("node data:%d\n",node->data);
	node->fun(node->userdata);
	list_delate(&head);
	list_printf(&head);
	node->data=12;
	add_node(&head,node);
	list_printf(&head);
}

void funtest()
{
	PNode* node= get_node(&head);
	node->fun(node->userdata);
}
int main()
{
	
	PNode test1={0};
	PNode test2={0};
	PNode test3={0};
	PNode test4={0};
	PNode test5={0};
	test1.data=10;
	test1.fun=callp;
	test1.userdata="1234test1";
	
	test2.data=30;
	test2.fun=callp;
	test2.userdata="5678test2";
	
	
	test3.data=20;
	test3.fun=nodecall;
	test3.userdata=&test2;
	
	test4.data=26;
	add_node(&head,&test1);
	list_printf(&head);
	add_node(&head,&test2);
	list_printf(&head);
	add_node(&head,&test3);
	list_printf(&head);
	add_node(&head,&test4);
	list_printf(&head);
	test5.data=700;
	add_node(&head,&test5);
	list_printf(&head);
	//return 0;
//	funtest();
	list_delate(&head);
	list_printf(&head);
	//funtest();
	list_delate(&head);
	list_printf(&head);
	//	funtest();
	//list_printf(&head);
	printf("this is test\n");
	return 0;
	
}