Given and AVL tree show (using pseudocode) how to support the following
queries:
RangeMin(K1, K2): consider the field data stored in each node to be an
interger. Find the key with minimum data values among all the keys which are
between k1 and k2 in O(log n) time. Hint: consider storing an additional
field in the Node structure and show how can this field be maintained during
updates.
Thank you very much
