Wrote one like a month ago, actually.. /* * Returns the smallest key greater than the search key. * This is because we index by the end, not the beginning */ static int btree_bsearch(struct btree ...

Personally, I'm surprised that no one has submitted a LISP (or Scheme) solution. I seem to recall doing this exercise once in HS in Pascal and then later in College in Scheme. It was much easier ...