isomorphic bt cpp

// program to check if 2 given trees are isomorphic or not
#include <iostream>

using namespace std;

// node class
class node{
public:
    int data;
    node* left;
    node* right;
};

// function that returns a pointer to new node
node* createNode(int element){
    node* temp = (node*) malloc(sizeof(node));
    temp->data = element;
    temp->left = NULL;
    temp->right = NULL;
    return temp;
}

// function to check if 2 given trees are isomorphic to each other
bool isomorphic_tree(node* root1, node* root2){
    // if both the nodes are null then return true
    if (root1 == NULL && root2 == NULL){
        return true;
    }
    // if any one of them is null then return false
    if (root1 == NULL || root2 == NULL){
        return false;
    }
    // if the data fields are not equal then return false
    if (root1->data != root2->data){
        return false;
    }
    // else check if the left and the right subtrees are isomorphic recursively
    return (
            ( isomorphic_tree(root1->left, root2->left) && isomorphic_tree(root1->right, root2->right) ) ||
            ( isomorphic_tree(root1->left, root2->right) && isomorphic_tree(root1->right, root2->left) )
    );
}



int main() {

    node* head = createNode(1);
    head->left = createNode(2);
    head->right = createNode(3);
    head->left->left = createNode(4);
    head->left->right = createNode(5);
    head->right->right = createNode(6);
    head->left->left->right = createNode(7);
    head->right->right->left = createNode(8);
    head->left->left->right->left = createNode(9);
    head->left->left->right->left->left = createNode(10);
    head->right->right->left->right = createNode(11);

    node* head2 = createNode(5);
    head2->left = createNode(2);
    head2->right = createNode(12);
    head2->left->left = createNode(-4);
    head2->left->right = createNode(3);
    head2->right->left = createNode(9);
    head2->right->right = createNode(21);
    head2->right->right->left = createNode(19);
    head2->right->right->right = createNode(25);

    node* i1 = createNode(1);
    i1->left = createNode(2);
    i1->right = createNode(3);
    i1->left->left = createNode(4);
    i1->left->right = createNode(5);
    i1->right->left = createNode(6);
    i1->left->right->left = createNode(7);
    i1->left->right->right = createNode(8);

    node* i2 = createNode(1);
    i2->left = createNode(3);
    i2->right = createNode(2);
    i2->right->left = createNode(4);
    i2->right->right = createNode(5);
    i2->left->right = createNode(6);
    i2->right->right->right = createNode(7);
    i2->right->right->left = createNode(8);

    cout<<"TREE #1 and TREE #2 are isomorphic : "<<isomorphic_tree(head, head2)<<endl;
    cout<<"TREE #3 and TREE #4 are isomorphic : "<<isomorphic_tree(i1, i2);


}



/*

TREE #1 and TREE #2 are isomorphic : 0
TREE #3 and TREE #4 are isomorphic : 1
Process finished with exit code 0

*/