[fpc-pascal] How To write an enumerator for trees

[Xiangrong Fang]

I am not creating a new thread, but just replied it.   My question is about
algorithm not syntax.  I will try the sample program by Kyan.

Thanks.


2013/3/21 Michael Schnell <mschnell at lumino.de>

> I have read this. My question is not about how to write enumerator, but
>> how to do this for TREEs
>>
>
> Xiangrong Fang: Please anser to a message instead of creating a new thread
> !
>
> There might be no necessary sort order of a tree.
>
> So you first need to invent a usable sort order and set up the enumerator
> accordingly. An Enumerator can work on any sort order it only needs to be
> strict.
> Regarding performance it is essential to use a sort order that allows for
> quickly finding the elements one after the other.
>
> -Michael
>
>
>
> ______________________________**_________________
> fpc-pascal maillist  -  fpc-pascal at lists.freepascal.**org<fpc-pascal at lists.freepascal.org>
> http://lists.freepascal.org/**mailman/listinfo/fpc-pascal<http://lists.freepascal.org/mailman/listinfo/fpc-pascal>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.freepascal.org/pipermail/fpc-pascal/attachments/20130321/6ed8bd0c/attachment.html>