Transfer the sum of all contiguous elements to right side zeros in a linked list

// C Program 
// Transfer the sum of all contiguous elements to right side zeros in a linked list
#include <stdio.h>
#include <stdlib.h> //for malloc function
//Linked List LinkNode
struct LinkNode
{
	int data;
	struct LinkNode *next;
};
// Singly linked list 
struct SingleLL
{
	struct LinkNode *head;
	struct LinkNode *tail;
};
// Returns the new linked list
struct SingleLL *newLinkedList()
{
	// Create memory of head and tail Nodes
	struct SingleLL *sll = (struct SingleLL *) malloc(sizeof(struct SingleLL));
	if (sll == NULL)
	{
		printf("Memory overflow\n");
	}
	else
	{
		sll->head = NULL;
	}
	return sll;
}
// 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 new Node at end of linked list 
void addNode(struct SingleLL *sll, int data)
{
	struct LinkNode *node = createLinkNode(data);
	if (sll->head == NULL)
	{
		sll->head = node;
	}
	else
	{
		struct LinkNode *temp = sll->head;
		//Find last node
		while (temp->next != NULL)
		{
			temp = temp->next;
		}
		// Append the node at last position
		temp->next = node;
	}
}
// Display linked list element
void display(struct SingleLL *sll)
{
	if (sll->head == NULL)
	{
		printf("\n Empty linked list\n");
		return;
	}
	struct LinkNode *temp = sll->head;
	//iterating linked list elements
	while (temp != NULL)
	{
		if (temp != sll->head)
		{
			printf(" →");
		}
		printf(" %d", temp->data);
		// Visit to next node
		temp = temp->next;
	}
	printf(" → NULL\n");
}
// Move the linked list to the right by the sum of the contiguous non-zero elements
void transform(struct SingleLL *sll)
{
	struct LinkNode *temp = sll->head;
	struct LinkNode *auxiliary = sll->head;
	sll->head = NULL;
	int sum = 0;
	while (temp != NULL)
	{
		if (temp->data != 0)
		{
			sum += temp->data;
			temp = temp->next;
		}
		else
		{
			temp->data = sum;
			if (sll->head == NULL)
			{
				// First resultant node get 
				sll->head = temp;
				auxiliary = temp;
				temp = temp->next;
			}
			else
			{
				// Add new sum result
				auxiliary->next = temp;
				auxiliary = temp;
				temp = temp->next;
			}
			// Avoid contiguous zero
			while (temp != NULL && temp->data == 0)
			{
				temp = temp->next;
			}
			sum = 0;
		}
	}
	if (sll->head == NULL)
	{
		// Linked list not converted because
		// When no zero exists in this linked list
		// Or all zero nodes exist in linked list
		sll->head = auxiliary;
	}
}
int main()
{
	// Create a empty linked lists
	struct SingleLL *sll1 = newLinkedList();
	struct SingleLL *sll2 = newLinkedList();
	struct SingleLL *sll3 = newLinkedList();
	//  Constructed first linked list
	//  2 → 5 → 0 → 8 → 0 → 4 → 9 → 7 → 0 → 1 NULL
	addNode(sll1, 2);
	addNode(sll1, 5);
	addNode(sll1, 0);
	addNode(sll1, 8);
	addNode(sll1, 0);
	addNode(sll1, 4);
	addNode(sll1, 9);
	addNode(sll1, 7);
	addNode(sll1, 0);
	addNode(sll1, 1);
	printf(" Before Convert \n");
	display(sll1);
	transform(sll1);
	printf(" After Convert \n");
	display(sll1);
	// Constructed second linked list
	//  1 → 2 → 0 → 0 → 0 → 6 → 0 → NULL
	addNode(sll2, 1);
	addNode(sll2, 2);
	addNode(sll2, 0);
	addNode(sll2, 0);
	addNode(sll2, 0);
	addNode(sll2, 6);
	addNode(sll2, 0);
	printf(" Before Convert \n");
	display(sll2);
	transform(sll2);
	printf(" After Convert \n");
	display(sll2);
	// Constructed third linked list
	//  1 → 2 → 3 → NULL
	addNode(sll3, 1);
	addNode(sll3, 2);
	addNode(sll3, 3);
	printf(" Before Convert \n");
	display(sll3);
	transform(sll3);
	printf(" After Convert \n");
	display(sll3);
	return 0;
}

Output

 Before Convert
 2 → 5 → 0 → 8 → 0 → 4 → 9 → 7 → 0 → 1 → NULL
 After Convert
 7 → 8 → 20 → 1 → NULL
 Before Convert
 1 → 2 → 0 → 0 → 0 → 6 → 0 → NULL
 After Convert
 3 → 6 → NULL
 Before Convert
 1 → 2 → 3 → NULL
 After Convert
 1 → 2 → 3 → NULL