List Reverse( List L )
{
PtrToNode head = L;
if(head)
{
PtrToNode temp = head;
PtrToNode last = NULL;
while (temp) {
temp = temp->Next;
head->Next = last;
last = head;
head = temp;
}
return last;
}else
{
return NULL;
}
}
{
PtrToNode head = L;
if(head)
{
PtrToNode temp = head;
PtrToNode last = NULL;
while (temp) {
temp = temp->Next;
head->Next = last;
last = head;
head = temp;
}
return last;
}else
{
return NULL;
}
}