Check if two trees are mirror

/*
    C Program 
    Check if two trees are mirror 
*/

#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 this
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;
}
//Display pre order elements
void preorder(struct Node *node)
{
	if (node != NULL)
	{
		//Print node value
		printf("  %d", node->data);
		preorder(node->left);
		preorder(node->right);
	}
}
//Determine whether given trees are mirror tree to each other or not
int check_mirror_tree(struct Node *first, struct Node *second)
{
	if (first == NULL && second == NULL)
	{
		//When both tree node is empty
		return 1;
	}
	else if (first == NULL || second == NULL || first->data != second->data)
	{
		//When the node of either tree is empty or when the node values are not equals.
		return 0;
	}
	//Recursively checking mirror nodes
	return check_mirror_tree(first->left, second->right) && check_mirror_tree(first->right, second->left);
}
//Handles the request to display mirror tree result
void is_mirror_trees(struct Node *first, struct Node *second)
{
	// Display the node elements of given binary tree
	printf("\n Given First Tree \n");
	preorder(first);
	printf("\n Given Second Tree \n");
	preorder(second);
	printf("\n  -------------------");
	if (check_mirror_tree(first, second))
	{
		//When Trees are mirrors
		printf("\n Trees are Mirror \n\n");
	}
	else
	{
		printf("\n Trees are not Mirror \n\n");
	}
}
int main()
{
	struct Node *root1 = NULL;
	struct Node *root2 = NULL;
	struct Node *root3 = NULL;
	/*
	constructor binary tree
	-----------------
	    10                            
	   /   \    
	  2     3     
	 / \      \               
	8   7      1
	   /      
	  6     
	-----------------
	First Tree
	*/
	root1 = get_node(10);
	root1->left = get_node(2);
	root1->left->left = get_node(8);
	root1->left->right = get_node(7);
	root1->left->right->left = get_node(6);
	root1->right = get_node(3);
	root1->right->right = get_node(1);
	/*
	constructor binary tree
	-----------------
	    10                            
	   /   \    
	  3     2     
	 /     /  \               
	1     7    8
	       \
	        6  
	        
	-----------------
	Second Tree
	*/
	root2 = get_node(10);
	root2->right = get_node(2);
	root2->right->right = get_node(8);
	root2->right->left = get_node(7);
	root2->right->left->right = get_node(6);
	root2->left = get_node(3);
	root2->left->left = get_node(1);
	/*
	constructor binary tree
	-----------------
	    10                            
	   /   \    
	  3     2     
	 /     /  \               
	1     7    8
	 \     \
	  1     6  
	        
	-----------------
	Third Tree
	*/
	root3 = get_node(10);
	root3->right = get_node(2);
	root3->right->right = get_node(8);
	root3->right->left = get_node(7);
	root3->right->left->right = get_node(6);
	root3->left = get_node(3);
	root3->left->left = get_node(1);
	root3->left->left->right = get_node(1);
	//  Test Case
	is_mirror_trees(root1, root2);
	is_mirror_trees(root1, root3);
	return 0;
}

Output

 Given First Tree
  10  2  8  7  6  3  1
 Given Second Tree
  10  3  1  2  7  6  8
  -------------------
 Trees are Mirror


 Given First Tree
  10  2  8  7  6  3  1
 Given Second Tree
  10  3  1  1  2  7  6  8
  -------------------
 Trees are not Mirror