创建反向链表（输入顺序与存储顺序相反

[color=blue][size=large]创建反向链表nodeType* buildListBackward() {    nodeType *first, *newNode;    first = NULL;    newNode = NULL;    int num;    cout<<"Enter a list number: ";    cin>>num;    while(num!=-999) {        newNode = new nodeType;        newNode->info = num;        newNode->next = NULL;        if(first==NULL) {            first = newNode;        }else {            newNode->next = first;            first = newNode;        }        cin>>num;    }    return first;}[/size][/color]