BST Rotations to make one tree equal to the other

Question

I have this problem: You are given two non-empty binary search tree T1 and T2.T1 and T2 store the same keys. The structure of both trees, however, is different. Implement an alg