从尾到头打印链表

题目描述：输入一个链表，从尾到头打印链表每个节点的值。

算法：

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>

typedef struct ListNode{
    int data;
    struct ListNode *next; 
}ListNode; 

void Print(ListNode *pHead){                            //递归实现逆序打印链表节点
    if(pHead != NULL){
        if(pHead->next != NULL){
            Print(pHead->next);
        }
        printf("%d\n", pHead->data); 
    }
}


ListNode *CreateList()                              //创建链表
{
    int num;
    ListNode *pHead = NULL;
    ListNode *p = NULL;
     
    do 
        {  
            scanf("%d",&num);  
            if(num != -1)                           //当输入的节点为-1时链表结束
            {  
                ListNode* pNew = (ListNode*)malloc(sizeof(ListNode));  
                if(pNew == NULL)  
                    exit(EXIT_FAILURE);  
                pNew->data = num;  
                pNew->next = NULL;  
       
                if(pHead == NULL)  
                {  
                    pHead = pNew;  
                    p = pHead;  
                }  
                else 
                {  
                    p->next = pNew;  
                    p = p->next;  
                }  
            }  
        }while(num != -1);  
        return pHead; 
} 


int main(){
    ListNode *h = CreateList();
    Print(h);
    return 0;
}