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