C-Data-Structures

Useful ready data structures written in C

• Red Black Tree
• Stack
• Queue
• Hash Table
• Linear Hash Table
• Priority Queue

All modules were coded with flexibility in mind.

That's why they all store 'Pointer', a typedef for 'void*'.

Keep in mind

• DestroyFunc: A function that frees up the allocated memory of the given pointer.
• CompareFunc: A function to compare 2 given pointers (data).
• VisitFunc: A function which is used on the data of a node or a block when it is visited