Can I get an iterative solution to this?

i mport i mport public java. to. java.utiL . class BST Problem: Perform rotations on treel to make it equivalent to tree2. public if static void problem(BST treel, BST tree2) Implement me! = null II (treel tree 2 return, null) { Find the root value of second BST in first Node tmp = treel.find(tree2.getRootKey); while(tmp treel.root) { Node tmp_parent = tmp. parent; if (tmp_parent.right tmp) { treel. rotateR(tmp) ; treel. ; else treel. rotateL (tmp) ; treel. rotateL (tmp_parent) ; // recursive method to reshape left sub tree left treel left tree2 left treel. root left tree2. root - new BST(); - new BST(); treel. root. left; tree2. root. left; problem(left_treel, left_tree2); // recursive method to reshape right sub tree right_t reel = new BST(); right_t ree2 = new BST(); right_treel.root = treel. root. right; right_tree2.root = tree2. root. right; problem(right_treel, right_tree2); // Do not change any of the code below!