C++ program to check for symmetric binary tree using recursion
Description:
This Program is to check for symmetric binary tree using recursion
For Example:
Input :
The Elements are : 1 ,2 ,2 ,3 ,4 ,4 ,3
Output :
Symmetric binary tree
Program :
//C++ program to check for symmetric binary tree using recursion
using namespace std;
// tree node
struct Node
{
int data;
Node *left, *right;
};
// returns a new tree Node
Node* newNode(int data)
{
Node* temp = new Node();
temp->data = data;
temp->left = temp->right = NULL;
return temp;
}
//return true if they are mirror
bool Mirror(struct Node *root1, struct Node *root2)
{
// if both empty
if (root1 == NULL && root2 == NULL)
return true;
// if both are non empty then comparing them
if (root1 && root2 && root1->data == root2->data)
return Mirror(root1->left, root2->right) &&
Mirror(root1->right, root2->left);
//if false
return false;
}
int main()
{
struct Node *root = newNode(1);
root->left = newNode(2);
root->right = newNode(2);
root->left->left = newNode(3);
root->left->right = newNode(4);
root->right->left = newNode(4);
root->right->right = newNode(3);
if(Mirror(root, root))
cout<<"Symmetric binary tree.";
else
cout<<"Not a Symmetric binary tree.";
getchar();
return 0;
}
Comments