Two ordered trees T′ and T′′ are said to be isomorphic if one of the following holds:
• Both T′ and T′′ are empty.
• Both T′ and T′′ consist of a single node
• The roots of T′ and T′′ have the same number k ≥ 1 of subtrees, and the i th such subtree of T′ is isomorphic to the i th such subtree of T′′ for i = 1, . . . ,k.
Design an algorithm that tests whether two given ordered trees are isomorphic.
What is the running time of your algorithm?
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.