Since no one seemed to have code that shows using B-Trees, I made some of my
own. If anyone wants it, e-mail me PRIVATELY at mcrm@...
It's nothing fancy, just creates a B-Tree, transverses it in order and
searches it. It's quite fast but I'm sure if I tinkered with it I could
squeeze more out of it - any suggestions for improvement are welcome since
this will be used in a project of mine.

Thanks!
Ryan
mcrm@... (don't use the address above - sorry, my goof but I can't
change it on this UNIX machine) :-(