输入一个链表，从尾到头打印链表每个节点的值

输入一个链表，从尾到头打印链表每个节点的值

typedef struct ptrNode
{
  int value;
  ptrNode* next;
}Node,*ptrLink;
ptrLink BinaryCreat(int* a,int len)
{
   ptrLink head=new Node;
   ptrLink ptr,tmp;
   ptr=head;
   ptr->value=a[0];
   for(int i=1;i<len;i++)
   {
	   tmp=new Node;
	   tmp->value =a[i];
	   ptr->next=tmp;
	   ptr=tmp;
   }
   ptr->next=NULL;
   return head;
}
void ReversePrint(ptrLink head)
{
   if(head==NULL)
	   return;
   if(head->next!=NULL)
   {
     ReversePrint(head->next);
   }
   printf("%d\n",head->value);
}
void main()
{
	int a[]={0,1,2,3,4,5,6,7,8,9,10};
	ptrLink p=BinaryCreat(a,11);
	ReversePrint(p);
}