Re: CF: ideas for next experiments

[Kjetil Torgrim Homme <kjetilho@ifi.uio.no>]

[David Andrew Michael Noelle]

>       IMHO, A binary search tree with a parent pointer would be the
>   ideal structure for this.

What does this look like?  I don't understand how you can reconcile a
binary tree with a next->next->next traverse method with only one
pointer added.


Kjetil T.
-
[you can put yourself on the announcement list only or unsubscribe altogether
by sending an email stating your wishes to crossfire-request@ifi.uio.no]