// Greetings and Salivatations, Neil!
void QuotedReply( Neil: recipient )
{
  char *Neil, *Don;
 #NB#> But not balancing it would have a worst case scenario of basically
 #NB#> having a linked list!  This would kinda defeat the Binary Tree idea.  
:)
Ugh. Good point.
 #NB#> It would also depend on how often the tree was searched compared to
 #NB#> be being updated.  If it was searched once, then updated there
 #NB#> would be no point.
This is close to what I was thinking: re-balancing the tree after the 
addition of each new node == mucho overhead.
 #NB#> I agree with you that there would be no real point in balancing, as
 #NB#> long as tree is small.  But I think it would be 'dangerous' to
 #NB#> ignore it, especially for very large trees.
How true. I think I'll go stick my foot in my mouth now. :)
};
// Don
... DOS never says "EXCELLENT command or filename"...
---
---------------