I'll help you implement the complete linked list functionality based on the lab requirements. Here's the comprehensive implementation: #ifndef LISTS_H #define LISTS_H #include #include #include typedef struct node { int player_id; int player_exp_points; struct node *next; } node_t; typedef struct list { node_t *head; node_t *tail; } list_t; list_t *create_empty_list(); void free_list(list_t *list); void print_list(list_t *list); void add_at_head(list_t *list, int player_id, int player_exp_points); void add_at_tail(list_t *list, int player_id, int player_exp_points); int remove_from_head(list_t *list); int remove_from_tail(list_t *list); int list_size(list_t *list); int is_empty(list_t *list); int get_exp_points(list_t *list, int target_player_id); void insert(list_t *list, int player_id, int player_exp_points); int delete(list_t *list, int player_id); #endif #include "lists.h" list_t *create_empty_list() { list_t *list = malloc(sizeof(list_t)); if (list == NULL) { return NULL; } list->head = NULL; list->tail = NULL; return list; } void free_list(list_t *list) { node_t *current = list->head; while (current != NULL) { node_t *next = current->next; free(current); current = next; } free(list); } void print_list(list_t *list) { node_t *current = list->head; while (current != NULL) { printf("%d: %d\n", current->player_id, current->player_exp_points); current = current->next; } } void add_at_head(list_t *list, int player_id, int player_exp_points) { node_t *new_node = malloc(sizeof(node_t)); new_node->player_id = player_id; new_node->player_exp_points = player_exp_points; if (list->head == NULL) { list->head = new_node; list->tail = new_node; new_node->next = NULL; } else { new_node->next = list->head; list->head = new_node; } } void add_at_tail(list_t *list, int player_id, int player_exp_points) { node_t *new_node = malloc(sizeof(node_t)); new_node->player_id = player_id; new_node->player_exp_points = player_exp_points; new_node->next = NULL; if (list->head == NULL) { list->head = new_node; list->tail = new_node; } else { list->tail->next = new_node; list->tail = new_node; } } int get_exp_points(list_t *list, int target_player_id) { node_t *current = list->head; while (current != NULL) { if (current->player_id == target_player_id) { return current->player_exp_points; } current = current->next; } return -1; } void insert(list_t *list, int player_id, int player_exp_points) { node_t *new_node = malloc(sizeof(node_t)); new_node->player_id = player_id; new_node->player_exp_points = player_exp_points; new_node->next = NULL; if (list->head == NULL) { list->head = new_node; list->tail = new_node; return; } node_t *prev = NULL; node_t *curr = list->head; while (curr != NULL && curr->player_id < player_id) { prev = curr; curr = curr->next; } if (prev == NULL) { new_node->next = list->head; list->head = new_node; } else if (curr == NULL) { prev->next = new_node; list->tail = new_node; } else { prev->next = new_node; new_node->next = curr; } } int delete(list_t *list, int player_id) { if (list->head == NULL) { fprintf(stderr, "List is empty\n"); return -1; } node_t *prev = NULL; node_t *curr = list->head; while (curr != NULL && curr->player_id != player_id) { prev = curr; curr = curr->next; } if (curr == NULL) { fprintf(stderr, "Player not found\n"); return -1; } int exp_points = curr->player_exp_points; if (prev == NULL) { list->head = curr->next; if (list->head == NULL) { list->tail = NULL; } } else { prev->next = curr->next; if (prev->next == NULL) { list->tail = prev; } } free(curr); return exp_points; } int list_size(list_t *list) { int count = 0; node_t *current = list->head; while (current != NULL) { count++; current = current->next; } return count; } int is_empty(list_t *list) { return list->head == NULL; } #include "lists.h" #include int main() { // Test create_empty_list list_t *first_list = create_empty_list(); assert(first_list != NULL); assert(first_list->head == NULL); assert(first_list->tail == NULL); // Test add_at_head add_at_head(first_list, 16, 42); assert(first_list->head != NULL); assert(first_list->head->player_id == 16); assert(first_list->head->player_exp_points == 42); assert(first_list->head == first_list->tail); // Test add_at_head with second node add_at_head(first_list, 18, 62); assert(first_list->head->player_id == 18); assert(first_list->head->next->player_id == 16); assert(first_list->tail->player_id == 16); // Test print_list printf("Testing print_list:\n"); print_list(first_list); // Test add_at_tail add_at_tail(first_list, 4, 20); assert(first_list->tail->player_id == 4); assert(first_list->head->next->next->player_id == 4); // Test get_exp_points int player_ids[] = {42, 78, 14, 36}; int player_exp_points[] = {16, 96, 43, 59}; list_t *search_list = create_empty_list(); for (int i = 0; i < 4; i++) { add_at_head(search_list, player_ids[i], player_exp_points[i]); } for (int i = 0; i < 4; i++) { int exp_points = get_exp_points(search_list, player_ids[i]); assert(exp_points == player_exp_points[i]); } assert(get_exp_points(search_list, 99) == -1); // Test insert (ordered list) list_t *ordered_list = create_empty_list(); for (int i = 0; i < 4; i++) { insert(ordered_list, player_ids[i], player_exp_points[i]); } node_t *p = ordered_list->head; while (p->next != NULL) { assert(p->player_id < p->next->player_id); p = p->next; } // Test delete int deleted_exp = delete(ordered_list, 36); assert(deleted_exp == 59); assert(get_exp_points(ordered_list, 36) == -1); // Test list_size assert(list_size(ordered_list) == 3); assert(is_empty(ordered_list) == 0); // Clean up free_list(first_list); free_list(search_list); free_list(ordered_list); printf("All tests passed!\n"); return 0; }