title: Algorithm to find k-th key in a B-tree?
body: <p>I'm trying to understand how I should think about getting the k-th key/element in a B-tree. Even if it's steps instead of code, it will still help a lot. Thanks</p>
  
  <p>Edit: To clear up, I'm asking for the k-th smallest key in the B-tree.</p>