以下这段程序将单链表逆转。（单链表不带有空头结点，链表头指针是head）例如，链表 1 -＞ 2 -＞ 3 -＞ 4 逆转后变为 4 -＞ 3 -＞ 2 -＞ 1 .

struct Node**phead

*phead

oldHead->next

newHead

tmp

&head

#include <stdio.h>
#include <stdlib.h>
struct Node{
    int data;
    struct Node* next;
};
struct Node* createList(){
  /* 细节省略 */
}
void reverseList( 
struct Node**phead 
 ){
    struct Node* tmp, *newHead, *oldHead;
    newHead = NULL;
    oldHead = 
*phead
 ;
    while(oldHead){
        tmp = oldHead;
        oldHead = 
oldHead->next
 ;
        tmp->next = 
newHead
 ;
        newHead = 
tmp
 ;
    }
    *phead = newHead;
}
int main(){
    struct Node* head=createList();
    reverseList( 
&head
 );
    return 0;
}