Due to the importance of pointers and linked data structures forming the foundation of much of the Data Structures content, having your own library handy with common routines for manipulating linked lists can be handy for both learning the concepts of linked lists, but also using with other projects you undertake.

To create a linked list library, you may want to have the following functions:

• create: generate a new node
• append: add a new node to the list (the end? after a given node?)
• remove: remove a node from the list
• search: find if a node exists (likely search by value)
• insert: add a new node to the list (the beginning? before a given node?)
• delete: destroy/de-allocate an existing list
• copy: duplicate an existing list

You can also explore singly vs. doubly-linked lists if you desire.

Making it into a library allows you to quickly utilize it with additional projects, and gives you experience with using code libraries.