Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
isTreesIdenticalRec(Node root1, Node root2) :
1. Termination Condition: If both trees are empty then return true.
2. else if both trees are non-empty
(a) Check data of the root nodes (root1->data == root2->data)
(b) Check left subtrees recursively
call isTreesIdenticalRec(root1->left, root2->left)
(c) Check right subtrees recursively
call isTreesIdenticalRec(root1->right, root2->right)
(d) If a,b and c are true then return true.
3. else return false(=one is empty and another is not).