#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
#include "log_macros.h"

typedef struct _Node {   // always called Node or ▒Node in ECE 26400
    int value;           // usually called 'value'
    struct _Node* next;  // address of the next node in the list
} Node;                  // Think of .next as your link to the next node.


void append(int value, Node** a_head, Node** a_tail) {
    Node* new_node = malloc(sizeof(*new_node));
    new_node -> value = value;
    new_node -> next  = NULL;

    if(*a_head == NULL) {  // If list is empty
        *a_head = new_node;
    }
    else {
        (*a_tail) -> next = new_node;  // append to end of list
    }

    *a_tail = new_node;
}

void print_list(Node* head) {
    for(Node* curr = head; curr != NULL; curr = curr -> next) {
        log_int(curr -> value);
    }
}

int main(int argc, char* argv[]) {
    // size==0  - empty list
    Node* head = NULL;   // first node in the list is always called 'head'
    Node* tail = NULL;
    append(10, &head, &tail);
    append(11, &head, &tail);
    append(12, &head, &tail);

    print_list(head);

    // [ 10 | → ] → [ 11 | → ] → NULL
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */