<< Could the person who sent me the code for red/black trees (Brian, was that you?) contact me quickly? I just need his name so I can attribute it to him in the sources (I just wrapped them in a C++ class which should relieve us of the tedious keeping of a pointer to a root node). I'd also need to know whether there's a recommended way to delete all nodes from a tree. Can I simply call delete on the root or do I have to do something more complicated?>> Hi Uli. Yes, that was me. My suggestion for delete would be to override the delete operator. Then you would need to simply navigate the tree (depth first?) and free up each node. So I guess that the answer is that it's something more complicated, but that if you use your implementation to override the delete operator, then you can still use it... HTH. Also, I don't mind writing the delete myself if that would be helpful. Either way is fine with me. Brian
