在链表中插入若干个数据，使其按升序从链表中输出这些数据

#include <stdio.h>
#include <malloc.h>

// 定义链表节点结构
typedef struct _node
{
int data;
struct _node *pNext;
}stNode;

int main()
{
stNode *pList=NULL;
stNode *pstNode=NULL,*pCurrent=NULL;
int ret,tempData;

while(1){
// 输入拟比较的数值
printf("please input your data.if you want to end,please input -9999:");
ret = scanf("%d",&tempData);
ret = printf("\nyou input:%d\n",tempData);
if(tempData == -9999){
break;
}

// 根据输入数值制作出节点
pstNode = (stNode*)malloc(sizeof(stNode));
if(!pstNode){
return -1;
}
pstNode->data = tempData;
pstNode->pNext = NULL;

// 把节点按升序插入到链表中
if((!pList)||(pstNode->data < pList->data)){
pstNode->pNext = pList;
pList = pstNode;
}else{
pCurrent = pList;
while(1){
if((pCurrent->pNex