//This is the header file for linked lists
//Include any #defines here and any function prototypes
//In addition to any comments about each of the functions

// This is the same header we used in Week07 - we will keep working in here
// This week we have three problems to do as revision
// Sasha Vassar Week10, Lecture 17

//Helper functions
struct node *create_node(int data, struct node *next);
struct node *insert_middle(int data, struct node *head);
struct node *insert_endnode(int data, struct node *head);
struct node *delete_node (int data, struct node *head);
void print_list(struct node *head);

//Revision problems helper functions
void find_divisible(int divisor, struct node *head);
struct node *delete_divisible(int data, struct node *head);
int find_range(struct node *head);
int find_smallest(struct node *head);
int find_largest(struct node *head);

struct node *insert_mid(int data, struct node *head);