SDE - Intern

You are given two arbitrary binary trees. You need to find if both trees are isomorphic or not.

Two binary trees are said to be isomorphic with each other, if one of the trees can be obtained from the other, by performing the following operation any number of times:

Choose a node of the tree, swap its left and right subtree i.e the left subtree will become the right one, and vice versa.

Note:

1. A binary tree is a tree in which each node has at most two children.   

2. The left subtree of a node, is the tree in which the left child of the node is the root of that tree, and the same holds for the right subtree.

3. The given operation can be performed on any node at any level of the given trees.  

4. Two empty trees are also said to be isomorphic.

You have been given an integer 'N'. Your task is to print the Magical Pattern(see examples) for the given 'N'.

Example :

For 'N' : 4
Pattern :
4 3 2 1 2 3 4                                                                   
3 3 2 1 2 3 3                                                                   
2 2 2 1 2 2 2                                                                   
1 1 1 1 1 1 1                                                                   
2 2 2 1 2 2 2                                                                   
3 3 2 1 2 3 3                                                                   
4 3 2 1 2 3 4

Tell me something about you

Why did you choose this profession?

What are your strengths and some field of life that you want to improve?