Print left and right leaf nodes in Binary Tree

/*
    C Program 
    Print left and right leaf 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;
};
// 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;
}
//Display Inorder view of binary tree
void inorder(struct TreeNode *node)
{
	if (node)
	{
		inorder(node->left);
		//Print node value
		printf("  %d", node->data);
		inorder(node->right);
	}
}
// Print all left leaf nodes
void printLeftLeaf(struct TreeNode *node, int status)
{
	if (node != NULL)
	{
		if (node->left == NULL && node->right == NULL)
		{
			if (status == 1)
			{
				// When get resultant left leaf node
				printf("  %d", node->data);
			}
			return;
		}
		// Recursively visiting left and right subtree
		printLeftLeaf(node->left, 1);
		printLeftLeaf(node->right, 0);
	}
}
// Print all right leaf nodes
void printRightLeaf(struct TreeNode *node, int status)
{
	if (node != NULL)
	{
		if (node->left == NULL && node->right == NULL)
		{
			if (status == 1)
			{
				// When get resultant right leaf node
				printf("  %d", node->data);
			}
			return;
		}
		// Recursively visiting left and right subtree
		printRightLeaf(node->left, 0);
		printRightLeaf(node->right, 1);
	}
}
// Handles the request of printing leaf nodes value
void printLeafNodes(struct TreeNode *root)
{
	if (root == NULL)
	{
		printf("\n Empty Tree \n");
		return;
	}
	// Print all tree elements
	printf("\n Tree Nodes\n");
	inorder(root);
	// Print all left leaf nodes
	printf("\n Left Leaf Nodes\n");
	printLeftLeaf(root, 1);
	// Print all right leaf nodes
	printf("\n Right Leaf Nodes\n");
	printRightLeaf(root, 0);
	printf("\n");
}
int main(int argc, char
	const *argv[])
{
	struct BinaryTree *tree = newTree();
	/*
	        15
	      /   \ 
	     /     \ 
	    /       \
	   /         \
	  11          8
	 /  \        / \
	3   10      6   14
	   /  \    / \   \
	  7    4  5   9   2
	-----------------------
	   Binary Tree
	-----------------------
	*/
	tree->root = newNode(15);
	tree->root->left = newNode(11);
	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(14);
	tree->root->right->left->left = newNode(5);
	tree->root->right->right->right = newNode(2);
	tree->root->left->right->right = newNode(4);
	// Leaf node (3,7,4,5,9,2)
	printLeafNodes(tree->root);
	return 0;
}

Output

 Tree Nodes
  3  11  7  10  4  15  5  6  9  8  14  2
 Left Leaf Nodes
  3  7  5
 Right Leaf Nodes
  4  9  2