Tree isomorphism Two unordered binary trees A and B are said to be isomorphic if, by swapping the left and right subtrees of certain nodes of A, one can obtain a tree identical to B. For example, the following two trees are isomorphic: Write the pseudocode of a recursive algorithm that tests if the trees rooted at two given tree Nodes are isomorphic