one minimal searchtree implementation...

...designed for the sole purpose of quickly computing the initial
ranks of the elements in a permutation of integers {0, ..., n-1} as
they get inserted into the search tree (by "initial rank" I mean the
entry's position in the search tree's inorder right after being
inserted into the tree; these "initial ranks" represent the digits of
the permutation's factorial representation).
significantly improved/debugged
implementation of lisp lists
bug fixes; obsessing
more obsessing...
best one yet
toy perl implementation of lisp lists
more hax
new aliases/fns
make default OFFSET=1
gets rid of error; not sure why
require whitespace mode