I've had my experiences with implementing Binary-Trees with
JAVA, and there are some things I'd just want to add to this
little conversation:
1. Maximum depth could be overcome by "moving" the structure
into a larger array (though a little parsing intensive, not at all
useless under certain circumstances).
2. Moving across the binary tree, using macros, would require
only a very simple system
3. Inserting and deleting entries using a dropping-algorithm
(forgot the actual name right now), where the smaller values
simply "trickle" through till the bottom of the tree, wouldn't be
that difficult to add, its just a recursive macro-call, or could perhaps
even be put into a while-loop

So, all in all, the question is rather, if the amount of macros and
parsing needed to use them all, is really needed, or if you can
go by with other means.

Just my two cents worth.

--
Tim Nikias
Homepage: http://www.digitaltwilight.de/no_lights/index.html

Post a reply to this message