学步园

node * reverse (node * head)
{
node * walk = head;
node * pre = NULL;
 while (walk != NULL)
{
node * next = walk->next;
walk->next = pre;
pre = walk;
walk = next ;
}
return pre;

}