//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 will look at inserting into a linked list at any position
// Sasha Vassar Week08, Lecture 13

//Helper functions
//TODO: Fill in the output and inputs to complete prototypes
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);