be implementing a program that uses a linked list. You will be implementing the following structure and functions:

stuct LinkedList { int value; LinkedList*next; }; 

append_node: Appends a new node (created using the new statement) to the end of the linked list.

insert_node: Inserts a new node (created using the new statement) at the specified location in thelist

delete_node: Deletes a node from the specified location in the list.

search_node: Searches the list for a value.

destroy_list: At the end of the program, this function loops through the entire list and destroys the list by using the delete statement on each dynamically allocated linked list node (to avoid a memory leak).

NOTES

Note that with a singly linked list, you need to maintain a head pointer (pointer to the beginning of the list). Typically, a tail pointer (pointer to the end of the list) is not maintained in a singly linked list (because you can only iterate from the beginning to the end), although it can be. NOTE: Sometimes a function will need to change the head pointer (i.e., change what the head pointer is pointing at), and this change needs to hold back in main. We've seen that by default, which you pass an address to a pointer parameter, it is passed by VALUE, meaning that we make a COPY of the address, and we have two pointers that are both pointing at the address. We can also pass an address to a pointer parameter by REFERENCE. To pass a pointer by reference in this assignment use the type LinkedList *&. This allows a change made to the head pointer inside of the function to hold back in main. LinkedList * will pass the pointer by value (don't do this if the head pointer needs to change though!!!)