Print all paths from leaf node to root

/*
  C Program 
  Print all paths from leaf node to root
*/
#include <stdio.h>

#include <stdlib.h>

//Structure of Binary Node
struct Node
{
	int data;
	struct Node *left, *right;
};
//Define the custom stack structure
struct MyStack
{
	//First is element of Binary tree node
	struct Node *element;
	//Second are used to hold information of next node
	struct MyStack *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 data and pointer values
		new_node->data = data;
		new_node->left = NULL; //Initially node left-child is NULL
		new_node->right = NULL; //Initially node right-child is NULL
	}
	else
	{
		printf("Memory Overflow\n");
		exit(0); //Terminate program execution
	}
	//return reference
	return new_node;
}
//Create a new stack element and return this newly node
struct MyStack *push(struct Node *tree_node, struct MyStack *head)
{
	//Create new node of Stack
	struct MyStack *node = (struct MyStack *) malloc(sizeof(struct MyStack));
	if (node != NULL)
	{
		//Set tree node
		node->element = tree_node;
		//Connect new node into head of Stack
		node->next = head;
	}
	else
	{
		printf("Memory Overflow\n");
		//Terminate program execution
		exit(0);
	}
	return node;
}
//Remove a top element of stack
void pop(struct MyStack **top)
{
	if ( *top != NULL)
	{
		struct MyStack *remove = *top;
		//Visit to next top element
		*top = remove->next;
		//set remove node values
		remove->element = NULL;
		remove->next = NULL;
		//free node memory
		free(remove);
		remove = NULL;
	}
}
//Function which is display the path from leaf to root
void print_path(struct MyStack *temp)
{
	if (temp != NULL)
	{
		printf("  %d  ", temp->element->data);
		print_path(temp->next);
	}
}
//This function are collect path information using stack and when get leaf node then displaying node value
void show_path(struct Node *root, struct MyStack **head)
{
	if (root != NULL)
	{
		//Add a new element into Stack
		*head = push(root, *head);
		show_path(root->left, head);
		show_path(root->right, head);
		if (root->left == NULL && root->right == NULL)
		{
			//when get leaf node then display path
			printf("\n[");
			print_path( *head);
			printf(" ]\n");
		}
		pop(head);
	}
}
int main()
{
	struct Node *root = NULL;
	/*Make A Binary Tree
	-----------------------
	        1
	       /  \
	      2    3
	     /    /  \
	    4    5    6
	   /  \      / 
	 -1    7    8  
	           / \
	          9   10
	*/
	//Insert node into Binary tree
	root = insert(1);
	root->left = insert(2);
	root->right = insert(3);
	root->right->right = insert(6);
	root->right->left = insert(5);
	root->left->left = insert(4);
	root->left->left->left = insert(-1);
	root->left->left->right = insert(7);
	root->right->right->left = insert(8);
	root->right->right->left->left = insert(9);
	root->right->right->left->right = insert(10);
	struct MyStack *head = NULL;
	//Display leaf to all root path
	//bottom up
	show_path(root, & head);
	return 0;
}

Output

[  -1    4    2    1   ]

[  7    4    2    1   ]

[  5    3    1   ]

[  9    8    6    3    1   ]

[  10    8    6    3    1   ]