Print all K-sum levels in a Binary Tree

// C program
// Print all K-sum levels in a Binary Tree
#include <stdio.h>

#include <stdlib.h>

//Node of binary tree
struct Node
{
	int data;
	struct Node *left, *right;
};
struct MyQueue
{
	int level;
	struct Node *element;
	struct MyQueue *next;
};
//Create a binary tree nodes and node fields (data,pointer) 
//And returning the reference of newly nodes
struct Node *insert(int data)
{
	//create dynamic memory to new binary tree node
	struct Node *new_node = (struct Node *) malloc(sizeof(struct Node));
	if (new_node != NULL)
	{
		//Set node value
		new_node->data = data;
		new_node->left = NULL;
		new_node->right = NULL;
	}
	else
	{
		printf("Memory Overflow\n");
	}
	//return reference
	return new_node;
}
//Create a queue node and returns this node
struct MyQueue *enqueue(struct Node *tree_node)
{
	//Make a new Queue node
	struct MyQueue *new_node = (struct MyQueue *) malloc(sizeof(struct MyQueue));
	if (new_node != NULL)
	{
		//Set node values
		new_node->element = tree_node;
		new_node->next = NULL;
	}
	else
	{
		printf("Memory Overflow\n");
	}
	return new_node;
}
//Remove a queue elements
void dequeue(struct MyQueue **front)
{
	if ( *front != NULL)
	{
		struct MyQueue *remove = *front;
		//Visit to next node
		*front = remove->next;
		remove->element = NULL;
		remove->next = NULL;
		//free node
		free(remove);
		remove = NULL;
	}
}
//Print all levels which sum is equal to given value
void level_sum(struct Node *root, int k)
{
	if (root != NULL)
	{
		//make a queue pointers
		struct MyQueue *front = NULL, *tail = NULL;
		struct MyQueue *temp = NULL;
		//Get first node of tree
		front = enqueue(root);
		//Start level of first node is one
		front->level = 1;
		//Set tail node to first node
		tail = front;
		struct Node *node = root;
		// Start to first node
		temp = front;
		// Get level elements into a queue
		while (temp != NULL)
		{
			//Tree node
			node = temp->element;
			if (node->left != NULL)
			{
				//Add new left child node
				tail->next = enqueue(node->left);
				tail->next->level = temp->level + 1;
				tail = tail->next;
			}
			if (node->right != NULL)
			{
				//Add new right child node
				tail->next = enqueue(node->right);
				tail->next->level = temp->level + 1;
				tail = tail->next;
			}
			//Visit to next node queue
			temp = temp->next;
		}
		//result node indicator
		int status = 0;
		int level = 0;
		int sum = 0;
		while (front != NULL)
		{
			level = front->level;
			status = 0;
			sum = 0;
			temp = front;
			//Calculate the sum of level node
			while (temp != NULL && temp->level == level)
			{
				sum += temp->element->data;
				temp = temp->next;
			}
			if (sum == k)
			{
				//When k sum exist
				status = 1;
				printf(" [");
			}
			// Traversal the tree level
			while (front != NULL && front->level == level)
			{
				if (status == 1)
				{
					//When sum is equal to k
					printf(" %d", front->element->data);
				}
				//remove  a queue node
				dequeue( &front);
			}
			if (status == 1)
			{
				printf(" ]\n");
			}
		}
		tail = NULL;
	}
	else
	{
		printf("Empty Tree\n");
	}
}
int main()
{
	struct Node *root = NULL;
	/*
	Construct Binary Tree
	-----------------------
	           10
	         /   \
	        2     3
	       /     / \
	      4     1   5
	     /  \    \    \
	    7    3    6   11
	        /  \     /
	       5    8   -3
	           / \    
	         -1   11

	-----------------------
	*/
	//Add node
	root = insert(10);
	root->left = insert(2);
	root->right = insert(3);
	root->right->right = insert(5);
	root->right->left = insert(1);
	root->left->left = insert(4);
	root->left->left->left = insert(7);
	root->left->left->right = insert(3);
	root->right->left->right = insert(6);
	root->right->right->right = insert(11);
	root->right->right->right->left = insert(-3);
	root->left->left->right->left = insert(5);
	root->left->left->right->right = insert(8);
	root->left->left->right->right->left = insert(-1);
	root->left->left->right->right->right = insert(11);
	level_sum(root, 10);
	return 0;
}

Output

 [ 10 ]
 [ 4 1 5 ]
 [ 5 8 -3 ]
 [ -1 11 ]