Two binary trees, $1$ and $2,$ are isomorphic if $1$ can be transformed into $2$ by swapping left and

right children of $($some of the$)$ nodes in $1.$ Note that the structure and values in the tree should be

considered. The two trees in Figure $1$ are isomorpic since A can be transformed into B if you swap

the children of A$,$ B$,$ and G$.$ Implement a method that checks if two trees are isomorphic. It is ok to

use a limited implementation of a binary tree, e$.$g$.,$ not containing general methods to add, delete,

etc.