Find average of levels in binary tree

// C program
// Find average of levels in 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;
    }
}
//Find the average of all levels in a given binary tree
void level_average(struct Node *root)
{
    if (root != NULL)
    {
        //make MyQueue pointers
        struct MyQueue *front = NULL, *tail = NULL;

        //Get first node of tree
        front = enqueue(root);
        //Start level of first node is one
        front->level = 1;

        tail = front;


        int level_counter = 1;

        struct Node *node = root;

        double sum = 0.0;

        printf("\n Level Averages ");
        //Execute loop until the queue is not empty
        while (front != NULL)
        {

            node = front->element;

            if (node->left != NULL)
            {
                //Add new left child node
                tail->next = enqueue(node->left);

                tail->next->level = front->level + 1;

                tail = tail->next;
            }
            if (node->right != NULL)
            {
                //Add new right child node
                tail->next = enqueue(node->right);

                tail->next->level = front->level + 1;
                tail = tail->next;
            }
            if (front->level != level_counter)
            {
                printf("\n Level %d -> %lf",level_counter,(sum/level_counter));
                
                //When level change
                sum = 0.0;

                level_counter = front->level;
               
            }

            sum += node->data;

            //remove element of queue
            dequeue( &front); 
        }

        tail = NULL;

        //last level

        printf("\n Level %d -> %lf \n",level_counter,sum/level_counter);
    }
    else
    {
        printf("Empty Linked List\n");
    }
}
int main()
{
    struct Node *root = NULL;
    /*  Construct Binary Tree
    -----------------------
               1
             /   \
            2     3
           /     / \
          4     9   6
         /  \    \    \
        7     8   4    10
    */
    //Add node
    root = insert(1);
    root->left = insert(2);
    root->right = insert(3);
    root->right->right = insert(6);
    root->right->left = insert(9);
    root->left->left = insert(4);
    root->left->left->left = insert(7);
    root->left->left->right = insert(8);
    root->right->left->right = insert(4);
    root->right->right->right = insert(10);
    
    //find level average
    level_average(root);

    return 0;
}

Output

 Level Averages
 Level 1 -> 1.000000
 Level 2 -> 2.500000
 Level 3 -> 6.333333
 Level 4 -> 7.250000