Single chain operation (a)

The head of a single linked list node having the inverted output

Thought: Whenever an access node, the first output node recursively behind it

void ReverseList(LinkList &L){
if(L->next!=NULL){
ReverseList(L->next);
}
printf("%d ",L->data);
}

Function call is: ReverseList (L-> next); node can not scratch, or will output the value of the head node