Data Structures

Here are the data structures with brief descriptions:

CBinaryNode
CCircle	Define a Circle structure Has the fields hidden by struct circle as (Point* center) and (float radius)
CListCircular	A List circular data structure. The last *next pointer points to the first
CListDouble	Linked List with double pointers
CListNode
CPoint	Struct Point as 2D space pointer
CPQueue	Priority Queue Data Structure. Like a normal queue about push/pop logic, but each individual now heave a weight. A inner heap implementation it's provided