C++ 给出一个链表的头结点，倒序打印链表

递归调用，先递归，再打印

#include<iostream>
#include<stdio.h>
using namespace std;

class list_node
{
public:
    int val;
    list_node* next;
};
void reshow(list_node* head)
{
    if(head->next != NULL)
    {
        reshow(head->next);
    }
    printf("%d\n",head->val);
}
int main()
{
    list_node a1;
    list_node a2;
    list_node a3;
    list_node a4;
    list_node a5;
    a1.val = 1;
    a2.val = 2;
    a3.val = 3;
    a4.val = 4;
    a5.val = 5;
    a1.next = &a2;
    a2.next = &a3;
    a3.next = &a4;
    a4.next = &a5;
    a5.next = NULL;
    list_node *tmp = &a1;

    reshow(tmp);
    return 0;

}