Consider T be an augmented red-black tree, where each node x has an attribute x. Size that is the number of internal nodes in subtree rooted at x. Provided such an augmented red-black tree T, a value low, and a positive integer k, explain an efficient method for determining the k smallest values in the dictionary which are greater than low.
Your method must take much less than O (n) time whenever k is much less than n. Analyze the time for your method.