算法设计,输出带头结点的单链表中所有结点的值

Question

如题所述

Answer 1

typedef struct NODE {
struct NODE *next;
void *value;
} Node;
typedef struct LINK {
struct NODE *head;
} Link;
void value_output(void *value) {
......
}
void link_output(Link *link) {
Node *curr = link->head;
while (curr != NULL) {
value_output(curr->value);
curr = curr->next;
}
}