Please answer the following in Java. Thank You.

Solve the following problems. Include the code. 4.26. Write the methods to perform the double rotation without the inefficiency of doing two single rotations. Write a method that takes as input a binary search tree, T, and two keys k1 and k2 which are ordered so that ki S k2, and prints all elements X in the tree such that k1 Key(X) s k2. Do not assume any information about the type of keys except that they can be ordered (consistently). Your program should run in O(K +log N) average time, where K is the number of keys printed. Bound the running time of your algorithm 4.37 4.46 Two binary trees are similar if they are both empty or both nonempty and have similar left and right subtrees. Write a method to decide whether two binary trees are similar. What is the running time of your method