It supports addition and removal of individual nodes, pruning and grafting of subtrees, finding a value, calculating size of subtrees, and calculating node depth in a tree.
Any questions, bugs, errors, or suggestions can be posted here.
If no one has the time, or the will, to test this, could you at least give me an example application of it?
If you subscribe to Test-Driven methodology, you would have written your test cases and testing harness code even BEFORE you start to code your tree data structure. Then you won't be asking ppl in this forum to help you test it isn't it ? Unless your test cases is not complete (which btw occur quite often in reality) :P