title: AVL Tree: Finding the key with the smallest data values in keys between two values in O(logn) time
body: <p>So I'm given an AVL tree.  And im trying to figure out at least the pseudocode to find the key with the minimum data values among all of the keys between two values k1 and k2. This is assuming that the field data stored in each node is an integer. I want to make sure that my pseudocode runs in O(logn) time. </p>
  
  <p>I know that I can do it by storing an extra field in the node structure..and showing how this field can be maintained during updates, but I don't know where to go from there.</p>