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 are given two arrays “initial” and “final”. All the elements in the array “initial” are zero initially. And all the elements of the array “final” are positive integers.

You have to find the minimum number of operations to convert the “initial” array into the “final” array using the following operation:

1. In one operation, you can select any contiguous subsequence of the “initial” array and increment each value by 1.

Note :

A contiguous subsequence of a list S is a subsequence made up of consecutive elements of S. If S is {5, 15, -30, 10, -5, 40, 10} then 15, -30, 10 is a contiguous subsequence.