Single-linked list reverse order

typedef struct node *linklist;

Revese linklist

Linklist Reverselinklist1 (linklist l) {

Linklist Current, p;

if (L = = NULL) {

return NULL;

}

Current = L-Next;

While (current, next! = NULL) {

p = Current, Next;

Current-next = P-Next;

P-Next = L-Next;

L-next = p;

}

return l;

}

Linklist Reverselinklist2 (linklist l) {

Linklist Current, p;

if (L = = NULL) {

return NULL;

}

Current = L-Next;

While (current, next! = NULL) {

p = Current, Next;

L-next = p;

Current-next = P-Next;

P-Next = current;

}

}

Linklist Reverselinklist3 (linklist l) {

Linklist NewList, temp;

NewList = (linklist) malloc (sizeof (struct node));

if (L = = NULL | | newlist = = NULL) {

return NULL;

}

NewList data = l-data;

NewList-next = NULL;

while (L-next! = NULL) {

temp = NewList Next;

NewList next = l--Next;

Next--next = l--Next;

Next = temp, newlist

}

Free (l);

return newlist;

}

Single-linked list reverse order