Write a method that takes as input a binary search tree, T, and two keys k1 and k2,which
Chapter 4, Problem 4.37(choose chapter or problem)
Write a method that takes as input a binary search tree, T, and two keys k1 and k2,which are ordered so that k1 k2, and prints all elements X in the tree such thatk1 Key(X) k2. Do not assume any information about the type of keys exceptthat they can be ordered (consistently). Your program should run in O(K + logN)average time, where K is the number of keys printed. Bound the running time ofyour algorithm.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer