Given two binary trees, the task is to find if both of them are identical or not.
Input: 1 1 / \ / \ 2 3 2 3 Output: Yes Explanation: There are two trees both having 3 nodes and 2 edges, both trees are identical having the root as 1, left child of 1 is 2 and right child of 1 is 3.
Input: 1 1 / \ / \ 2 3 3 2 Output: No Explanation: There are two trees both having 3 nodes and 2 edges, but both trees are not identical.
Since this is a functional problem you don't have to worry about input, you just have to complete the function isIdentical() that takes two roots as parameters and returns true or false. The printing is done by the driver code.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).
1 <= Number of nodes <= 105
1 <=Data of a node <= 105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes