Josephus circle using circular linked list

/*
    C Program 
    Josephus circle using circular linked list
*/
#include <stdio.h>
#include <stdlib.h>

 // Linked List Node
struct LinkNode
{
	int data;
	struct LinkNode *next;
};
// Circular List
struct CircularList
{
	struct LinkNode *head;
	struct LinkNode *rear;
};
// Returns a new linked list
struct CircularList *newCLL()
{
	// Create dynamic node
	struct CircularList *cll = (struct CircularList *) malloc(sizeof(struct CircularList));
	if (cll != NULL)
	{
		cll->head = NULL;
		cll->rear = NULL;
	}
	else
	{
		// When memory are not allocated 
		printf("Memory Overflow to Create Circular List\n");
	}
	return cll;
}
// Returns a new Node of linked list
struct LinkNode *createLinkNode(int data)
{
	// Create dynamic node
	struct LinkNode *node = (struct LinkNode *) malloc(sizeof(struct LinkNode));
	if (node == NULL)
	{
		printf("Memory overflow\n");
	}
	else
	{
		// Set initial node value
		node->data = data;
		node->next = NULL;
	}
	return node;
}
// Add node in circular linked list
void addNode(struct CircularList *cll, int data)
{
	struct LinkNode *node = createLinkNode(data);
	if (cll->head == NULL)
	{
		// First node of linked list
		cll->head = node;
	}
	else
	{
		// Add new node at last position
		cll->rear->next = node;
	}
	// Connect the first node to the last
	node->next = cll->head;
	// Get new last node
	cll->rear = node;
}
// Implement josephus circle in circular linked list
void josephusCircle(int size, int n)
{
	if (n <= 0)
	{
		return;
	}
	if (n == 1)
	{
		// Base case
		printf(" Josephus Position  %d \n", size);
		return;
	}
	struct CircularList *cll = newCLL();
	// Construct linked list 
	for (int i = 1; i <= size; ++i)
	{
		addNode(cll, i);
	}
	// Define some auxiliary variables
	struct LinkNode *auxiliary = cll->head;
	struct LinkNode *back = cll->head;
	int counter = 0;
	// Execute loop until when more than one node in linked list
	while (auxiliary->next != auxiliary)
	{
		// Used to find n-th node
		counter = 1;
		while (counter != n)
		{
			// Get current node
			back = auxiliary;
			// Visit to next node
			auxiliary = auxiliary->next;
			counter++;
		}
		// Segregating n-th position node
		back->next = auxiliary->next;
		// Free the node memory    
		free(auxiliary);
		// Visit to next node
		auxiliary = back->next;
	}
	printf("\n Size : %d  N : %d \n", size, n);
	// Display last remaining node
	printf(" Josephus Position  %d \n", auxiliary->data);
}
int main(int argc, char
	const *argv[])
{
	// Number of element in circle
	int size = 10;
	int n = 4;
	josephusCircle(size, n);
	n = 6;
	josephusCircle(size, n);
	return 0;
}

Output

 Size : 10  N : 4
 Josephus Position  5

 Size : 10  N : 6
 Josephus Position  3