C++链表的反转

#include <iostream>
using namespace std;

typedef struct Node
{
    int data;
    Node * next;
}Node,*List;

//顺序建表：尾插法
void CreateLinkList(List& L, int n)
{
    //  建立空表
    L = (List)malloc(sizeof(Node));
    L->next = NULL;    //空表
    List p = L;    //用p指向表尾
    //  插入元素
    for(int i=0; i<n; i++ )
    {
        int x;
        cin>>x;
        List s = (List) malloc(sizeof(Node));
        s->data = x;
        //  插入表尾
        s->next = p->next;
        p->next = s;
        p = s;    //  新的表尾
    }
}

//逆序建表：头插法
void CreateLinkList2(List& L, int n)
{
    //  建立空表
    L = (List) malloc(sizeof(Node));
    L->next = NULL;  // 空表
    //  插入元素
    for (int i=0; i<n; i++ )
    {
        int x;
        cin>>x;
        List s = (List) malloc(sizeof(Node));
        s->data = x;
        //  插入表头
        s->next = L->next;
        L->next = s;
    }
}

void PrintLinkList(List L)
{
   List p = L->next;
   while( p!=NULL )
   {
       cout<<p->data<<" ";
       p = p->next;
   }
   cout<<endl;
}