链表转置

#include<iostream>
#include<cstdio>
using namespace std;
struct node
{
    int value;
    node *next;
    node()
    {
        value = 0;
        next = NULL;
    }
};
void print(node* List)
{
    node *p = List->next;
    while(p != NULL)
    {
        cout<<p->value;
        p = p->next;
    }
    cout<<endl;
}
int main()
{
    node *List = new node;
    node *q,*p = List;
    for(int i = 1; i <= 5; i++)
    {
        q = new node;
        q->value = i;
        p->next = q;
        p = q;
    }
    node *pre = NULL;
    node *next = NULL;
    print(List);
    node * root = List->next;
    while(root)
    {
        next = root->next;
        root->next = pre;
        pre = root;
        root = next;
    }
    List->next = pre;
    print(List);
    return 0;
}