Sum and product of internal nodes in binary tree

/*
    C Program 
    Sum and product of internal nodes in binary tree
*/
#include <stdio.h>
#include <stdlib.h>

 // Tree Node
struct TreeNode
{
	int data;
	struct TreeNode *left;
	struct TreeNode *right;
};
// Binary Tree
struct BinaryTree
{
	struct TreeNode *root;
};
struct Result
{
	int sum;
	int product;
};
// Create new tree
struct BinaryTree *newTree()
{
	// Create dynamic node
	struct BinaryTree *tree = (struct BinaryTree *) malloc(sizeof(struct BinaryTree));
	if (tree != NULL)
	{
		tree->root = NULL;
	}
	else
	{
		printf("Memory Overflow to Create tree Tree\n");
	}
	//return new tree
	return tree;
}
// returns a new node of tree
struct TreeNode *newNode(int data)
{
	// Create dynamic node
	struct TreeNode *node = (struct TreeNode *) malloc(sizeof(struct TreeNode));
	if (node != NULL)
	{
		//Set data and pointer values
		node->data = data;
		node->left = NULL;
		node->right = NULL;
	}
	else
	{
		//This is indicates, segmentation fault or memory overflow problem
		printf("Memory Overflow\n");
	}
	//return new node
	return node;
}
// Function which is calculating the sum and product of internal nodes
void getResult(struct TreeNode *node, struct Result *output)
{
	if (node != NULL)
	{
		if (node->left != NULL || node->right != NULL)
		{
			// When node is internal node
			output->sum += node->data;
			output->product *= node->data;
		}
		// Recursively visiting left and right subtree
		getResult(node->left, output);
		getResult(node->right, output);
	}
}
// Handles the request of finding sum and product of all internal nodes in binary tree
void sumAndProduct(struct TreeNode *root)
{
	if (root == NULL)
	{
		printf("\n Empty Tree \n");
		return;
	}
	// Create dynamic result node
	// Otherwise use two variable which is pass by reference
	struct Result *output = (struct Result *) malloc(sizeof(struct Result));
	output->sum = 0;
	output->product = 1;
	getResult(root, output);
	// Sum and product of internal nodes
	printf(" Sum : %d", output->sum);
	printf("\n Product : %d\n", output->product);
}
int main(int argc, char
	const *argv[])
{
	struct BinaryTree *tree = newTree();
	/*
	      1
	    /  \
	   /    \
	  2      8
	 / \    / \
	3  10  6   4
	   /  / \   \
	  7  5   9   11
	   
	-----------------------
	   Binary Tree
	-----------------------
	*/
	tree->root = newNode(1);
	tree->root->left = newNode(2);
	tree->root->right = newNode(8);
	tree->root->left->left = newNode(3);
	tree->root->left->right = newNode(10);
	tree->root->left->right->left = newNode(7);
	tree->root->right->left = newNode(6);
	tree->root->right->left->right = newNode(9);
	tree->root->right->right = newNode(4);
	tree->root->right->left->left = newNode(5);
	tree->root->right->right->right = newNode(11);
	sumAndProduct(tree->root);
	return 0;
}

Output

 Sum : 31
 Product : 3840