逆序链表

linknode * reverserLinkNode(linkNode * rootNode){

linkNode * prev= NULL;

linkNode * Next;

while(rootNode != NULL){

Next = rootNode->next;

rootNode->next=prev;

prev=rootNode;

rootNode = Next;

}

return prev;

}