Given two Binary Trees. Check whether they are Isomorphic or not.
Input: T1 1 T2: 1 / \ / \ 2 3 3 2 / / 4 4 Output: No
Input: T1 1 T2: 1 / \ / \ 2 3 3 2 / \ 4 4 Output: Yes
You don't need to read input or print anything. Your task is to complete the function isIsomorphic() that takes the root nodes of both the Binary Trees as its input and returns True if the two trees are isomorphic. Else, it returns False. (The driver code will print Yes if th returned values is true, otherwise false.)
Two trees are called isomorphic if one of them can be obtained from other by a series of flips, i.e. by swapping left and right children of a number of nodes. Any number of nodes at any level can have their children swapped. Two empty trees are isomorphic.
For example, following two trees are isomorphic with following sub-trees flipped: 2 and 3, NULL and 6, 7 and 8.
Expected Time Complexity: O(min(M,N)) where M and N are the sizes of the two trees.
Expected Auxiliary Space: O(min(H1,H2)) where H1 and H2 are the heights of the two trees.
1<=Number of nodes<=105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes