Re: Followup about binary trees

[Marcus G. Daniels]

>>>>> "PJ" == Paul E Johnson <address@hidden> writes:

PJ> But I still don't understand it or your comment.  Can you put some
PJ> more words down for me?  Apparently, a node is considered found
PJ> when it is compared against itself, and 0 is returned? 

A node is found when it's relative intended linkage in the tree is
identified.  The identification requires using a comparison function,
and that function should return zero if two nodes are equal.  If nodes
are never equal, you'll just accumulate more and more nodes with
tsearch, and you'll be unable to delete nodes with tdelete.

                  ==================================
   Swarm-Support is for discussion of the technical details of the day
   to day usage of Swarm.  For list administration needs (esp.
   [un]subscribing), please send a message to <address@hidden>
   with "help" in the body of the message.