Grrrrr.... I wish I could tar and feather the person who
wrote the GNU tsearch manpage. If you're going to include a
source code example, could you at least make sure that it works?
For those of you not aware, tsearch has a simple program
which inserts 12 random numbers into a tree and prints them
out. Only that because of a bug, it only prints out 6 of them.
I'll admit that I'm no C wiz, I couldn't even figure out
what was wrong with the code (a friend of mine pointed out
that they delete the root node after processing the left
side of the tree, preventing further processing).
Anyways, now that I know that the tsearch functions aren't
horribly broken, I can continue working on my code. Yippie!