C语言 单向链表倒序

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

typedef struct _ListElement ListElement;

struct _ListElement{

 ListElement* next;
 int x; 

};

ListElement* reservet( ListElement* ele )
{

 ListElement* curEle = ele;
 ListElement* lastEle = ele;
 ListElement* tmpEle = NULL;

 while (curEle)
 {
  tmpEle = curEle->next;
  curEle->next = lastEle;
  lastEle = curEle;
  curEle = tmpEle;
 }

 ele->next = NULL;

 return lastEle;

}

int main()
{

 ListElement* tmpEle = NULL;
 ListElement* firstEle = NULL;
 int i;
 for ( i = 0; i < 10; ++i)
 {
  ListElement* newEle = (ListElement*)malloc(sizeof(ListElement));
  newEle->x = i;
  newEle->next = NULL;
  if (tmpEle)
  {
   tmpEle->next = newEle;
  }
  else
  {
   firstEle = newEle;
  }
  tmpEle = newEle;
 }

 tmpEle = reservet( firstEle );
 firstEle = tmpEle;

 while(tmpEle)
 {
  printf( "%d\n", tmpEle->x);
  tmpEle = tmpEle->next;
 }

 tmpEle = firstEle;
 while(tmpEle)
 {
  firstEle = tmpEle;
  tmpEle = tmpEle->next;
  free(firstEle);
 }

 getchar();

 return 0;
}