Sum of heights of all every nodes in a binary tree

/*
    C Program 
    Sum of heights of all every nodes in a binary tree
*/
#include <stdio.h>
#include <stdlib.h>

//Binary Tree node
struct Node
{
    int data;
    struct Node *left, *right;
};

//This is creating a binary tree node and return new node
struct Node *get_node(int data)
{
    // Create dynamic node
    struct Node *new_node = (struct Node *) malloc(sizeof(struct Node));
    if (new_node != NULL)
    {
        //Set data and pointer values
        new_node->data = data;
        new_node->left = NULL;
        new_node->right = NULL;
    }
    else
    {
        //This is indicates, segmentation fault or memory overflow problem
        printf("Memory Overflow\n");
    }
    //return new node
    return new_node;
}
//Calculates the sum of the height of each node in the binary tree
int height_sum(struct Node*node,int *height)
{

    if(node == NULL)
    {
        return 0;
    }
    // Find the height of left and right subtree
    int a = height_sum(node->left,height);
    int b = height_sum(node->right,height);

    if(a > b)
    {
        // add new height
        *height += a+1;

        return a+1;
    }
    else
    {
        // add new height
        *height += b+1;

        return b+1;
    }
}

//Display inorder elements
void print_inorder(struct Node *node)
{
    if (node != NULL)
    {
        print_inorder(node->left);
        //Print node value
        printf("  %d", node->data);
        print_inorder(node->right);
    }
}
//Handles the request to find height of each node in given binary tree
void height_of_nodes(struct Node*root)
{
    if(root==NULL)
    {
        printf("\n Empty Tree");
    }
    else
    {
        int height = 0;

        height_sum(root,&height);

        printf("\n Tree Node : ");
        print_inorder(root);

        //Display the calculated result
        printf("\n Total height : %d \n",height);
    }
}
int main()
{

    struct Node*root = NULL;

    /*  Binary Tree
    -----------------------
                  17
                /    \
              11      13
             / \     /  \
            12  9   10   2
           /   / \   \  
          4   5   8   3
    */

    //Add nodes
    root                     = get_node(17);
    root->left               = get_node(11);
    root->right              = get_node(13);
    root->right->right       = get_node(2);
    root->right->left        = get_node(10);
    root->right->left->right  = get_node(3);
    root->left->left         = get_node(12);
    root->left->left->left   = get_node(4);
    root->left->right        = get_node(9);
    root->left->right->left  = get_node(5);
    root->left->right->right = get_node(8);


    //Display Tree elements
    height_of_nodes(root);
    return 0;
   
}

Output

 Tree Node :   4  12  11  5  9  8  17  10  3  13  2
 Total height : 21