identical cpp

// http://code2begin.blogspot.com
// program to check if 2 trees are identical 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 identical to each other
bool isIdentical(node* root1, node* root2){
    // if both the nodes are null then return true
    if (root1 == NULL && root2 == NULL){
        return true;
    }

    // if the node are not null then check
    // 1. do nodes have same data
    // 2. do the have identical left subtrees
    // 3. do the have identical right subtrees
    if (root1 != NULL && root2 != NULL){
        return (
                root1->data == root2->data &&
                isIdentical(root1->left, root2->left) &&
                isIdentical(root1->right, root2->right)
        );
    }
    return false;
}

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* head3 = createNode(1);
    head3->left = createNode(2);
    head3->right = createNode(3);
    head3->left->left = createNode(4);
    head3->left->right = createNode(5);
    head3->right->right = createNode(6);
    head3->left->left->right = createNode(7);
    head3->right->right->left = createNode(8);
    head3->left->left->right->left = createNode(9);
    head3->left->left->right->left->left = createNode(10);
    head3->right->right->left->right = createNode(11);

    cout<<"TREE #1 and TREE #2 are identical : "<<isIdentical(head, head2)<<endl;
    cout<<"TREE #1 and TREE #3 are identical : "<<isIdentical(head, head3);

}

/*

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

*/