example linked lists implementation

linkedlists.c

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

typedef struct {
	int x;
	int y;
	float health;
} monster_t;

typedef struct {
	void *next;
	monster_t *monster;
} monster_list_t;

monster_list_t* list_create();
monster_list_t* list_append(monster_list_t *list, monster_t monster);

// Linked List Functions

monster_list_t* list_create() {
	monster_list_t* list = (monster_list_t*) malloc(sizeof(monster_list_t));
	list->monster = NULL;
	list->next = NULL;
	
	return list;
}

monster_list_t* list_append(monster_list_t *list, monster_t monster) {
	while(list->next != NULL) list = list->next; // go to the last element
	
	list->monster = (monster_t*) malloc(sizeof(monster_t));
	*list->monster = monster;
	
	list->next = list_create();
	
	return list->next;
}

int main() {
	monster_list_t *monsters = list_create();
	
	// adding monsters to the list
	for(int i=0; i<6; i++){
		monster_t m = {rand()%20, rand()%20, 100.0f};
		list_append(monsters, m);
	}
	
	// enumerating through a list
	monster_list_t *head = monsters;
	while(head->next != NULL) {
		monster_t *monster = head->monster;
		printf("Found a monster at %d, %d with %.1f health.\n", monster->x, monster->y, monster->health);
		head = head->next;
	}
}