Please answer in Java thank you!

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 ki s 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