diff --git a/Binary Tree/Check_MirrorTrees.cpp b/Binary Tree/Check_MirrorTrees.cpp
new file mode 100644
index 0000000..2554868
--- /dev/null
+++ b/Binary Tree/Check_MirrorTrees.cpp	
@@ -0,0 +1,61 @@
+// C++ program to check if two trees are mirror 
+// of each other 
+#include<bits/stdc++.h> 
+using namespace std; 
+  
+/* A binary tree node has data, pointer to 
+   left child and a pointer to right child */
+struct Node 
+{ 
+    int data; 
+    Node* left, *right; 
+}; 
+  
+/* Given two trees, return true if they are 
+   mirror of each other */
+int areMirror(Node* a, Node* b) 
+{ 
+    /* Base case : Both empty */
+    if (a==NULL && b==NULL) 
+        return true; 
+  
+    // If only one is empty 
+    if (a==NULL || b == NULL) 
+        return false; 
+  
+    /* Both non-empty, compare them recursively 
+     Note that in recursive calls, we pass left 
+     of one tree and right of other tree */
+    return  a->data == b->data && 
+            areMirror(a->left, b->right) && 
+            areMirror(a->right, b->left); 
+} 
+  
+/* Helper function that allocates a new node */
+Node* newNode(int data) 
+{ 
+    Node* node = new Node; 
+    node->data  = data; 
+    node->left  =  node->right  = NULL; 
+    return(node); 
+} 
+  
+/* Driver program to test areMirror() */
+int main() 
+{ 
+    Node *a = newNode(1); 
+    Node *b = newNode(1); 
+    a->left = newNode(2); 
+    a->right = newNode(3); 
+    a->left->left  = newNode(4); 
+    a->left->right = newNode(5); 
+  
+    b->left = newNode(3); 
+    b->right = newNode(2); 
+    b->right->left = newNode(5); 
+    b->right->right = newNode(4); 
+  
+    areMirror(a, b)? cout << "Yes" : cout << "No"; 
+  
+    return 0; 
+} 
\ No newline at end of file