Reverse order of single linked list

Inverse single linked list (head insertion method for lead node)

void reverse (linklist L)//chain header pointer does not need to change; function set to no return value

{

Lnode*p,*q;

p= l->next; A linked list that does not lead the node and contains all the source data

l->next=null; Empty the original chain table

Construction of new linked list by head interpolation

while (p!= NULL)//has finished processing all the nodes to be inserted.

{

Q=p; Q Point to the node to be inserted

p=p->next; P points to the remaining not inserted nodes outside of the node to be inserted

q->next=l->next; 3

l->next=q; 4

3, 42: Insert new node using head interpolation

}

}

Note: You can handle the following special cases

1. Empty linked list

2. Only one node

3. The above two situations can also be specially dealt with in the function