逆序打印链表

#include<stdio.h>

#include<stdlib.h>

typedef struct node {

    char *data; 

    struct node *next; 

} node_t,*Node;

void re_tra_link(node_t *head)

{

if(head)
{

re_tra_link(head->next);
//p=p->next;
printf("%s",head->data);
}

}

int main()

{
node_t  e= {"e", 0},d = {"d", &e}, c = {"c", &d}, b = {"b", &c}, a = {"a", &b}; 
//e.next=&a;

re_tra_link(&a);

return 0;
}

逆序打印链表，使用递归调用，就是让系统自己调用栈来实现