|
|
Posted by Hilarion on 10/13/84 11:25
> Nice solution (not quite preorder as I see it, but close). Quite complicated.
> And what if I want to select children of a node (not whole subtree)?
> What if the hierarchy is not a binary tree, but a tree in general (amount
> of children is not limited) or even a forest of such trees?
> And finally: Anon looked for any way to make deleting easier, not to
> speed up selection, so your idea is a bit off topic (which does not mean
> that I do not like that idea or that I do not like that your answer
> appeared in this topic).
Stefan provided a link to an article describing the concept. I just started
to read it but allready noticed that this can be also used for any tree
(not only binary trees) and probably also for forests of trees. So please
excuse my previous - premature - post. I'll probably post again after
finishing the article. I'm quite surprised that I haven't heard about
this technique before.
Hilarion
Navigation:
[Reply to this message]
|