#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

typedef struct _Node {
    int value;
    struct _Node* next;
} Node;

void free_list_iterative(Node** a_head) {
    while(*a_head != NULL) {
        Node* curr = (*a_head) -> next;  // whatis (*a_head) → Node*
        // If *a_head was the tail, then curr is now NULL.
        free(*a_head);
        *a_head = curr;
    }
    assert(*a_head == NULL);  // should *always* be the case if that code works
}

int main(int argc, char* argv[]) {
    // First node:  2
    Node* head = malloc(sizeof(*head));
    Node* curr = head;
    curr -> value = 2;

    // Second node:  6
    curr -> next = malloc(sizeof(*curr -> next));
    curr = curr -> next;
    curr -> value = 6;

    curr -> next = NULL;

    free_list_iterative(&head);
    assert(head == NULL);

    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */