It is actually a binary search tree. This is the most used tree out of all the types of trees so I decided to implement it. It still has alot of work to be done before it can be considered complete (like adding a delete function) but you have to start somewhere!
This function will search through the list and see if we have that data in the list. Inorder to acomplish this we need the client to implement a compare_to() function since we have no idea what these pointers point to. The compare_to() function is alot like Java's. Will be adding an example in the main file.
Updated README to contain the new project name. My plan for this project is to provide a simple C library that can be used on hardware where performance and ease-of-use matters. The name of Lightweight C Library seems to fit what this project is trying to acomplish.