{"post":"

Problem

We need to check that the given trees are identical or not.

Approach

We will check for each node in both the trees.

There will be three cases:

If the root of both trees is NULL this means trees are identical.
If one node is NULL and the other is not, this means trees are not identical.
If both node's data is not equal then trees are not identical.
Now we will recursively traverse all the nodes and follow the above steps for every node.

#include<bits/stdc++.h>\nusing namespace std;\nstruct Node{\nint data;\nNode* left;\nNode* right;\nNode(int data){\nthis->data = data;\nleft = right = NULL;\n}\n};
\nbool isIdentical(Node *root1, Node *root2){\nif(root1 == NULL && root2 == NULL) return true;
\nif((root1 && !root2) || (!root1 && root2)) return false;\n\nif(root1-&gt;data != root2-&gt;data) return false;\n\nreturn isIdentical(root1-&gt;left, root2-&gt;left) && isIdentical(root1-&gt;right, root2-&gt;right);\n
\n}
\nint main() {\n/*\n1\n/    
\n2      3\n/   \\   /  
\n4     5 6    7\n/\nstruct Node root = new Node(1);\nroot->left = new Node(2);\nroot->left->left = new Node(4);\nroot->left->right = new Node(5);\nroot->right = new Node(3);\nroot->right->left = new Node(6);\nroot->right->right = new Node(7);\ncout<<isIdentical(root, root);
\nreturn 0;\n
\n}

TC – O(N)

\n","title":"Check for identical binary trees","authorDetails":{"name":"studymite","slug":"admin"},"description":"In this problem we will find that the given binary trees are identical to each other or not.","slug":"check-for-identical-binary-trees/","articleId":"636a83417bb1ce5072622afe","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}