Two binary trees are isomorphic if they have the same shape (i.e. they have identical structures.) Implement the following recursive method:

 public static  boolean isomorphic(BTNode T1, BTNode T2) { /* your code here */ } 

that returns true if the trees rooted at T1 and T2 are isomorphic, and false otherwise. BTNode is defined as follows:

 public class BTNode { T data; BTNode left, right; BTNode(T data, BTNode left, BTNode right) { this.data = data; this.left = left; this.right = right; } } 

Two binary trees are isomorphic if they have the same shape (i.e. they have identical structures mplement the following recursive method public static T boolean. isomorphic (BTNode T T1, BTNode T T2) your code here that returns true if the trees rooted at T1 and T2 are isomorphic, and false otherwise. B is defined as follows public class BTNode T> T data; BTNode T> left, right BTNode (T data, BTNode T 1eft, BTNode T right) this. data data this. left left this right F right