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

[waldo kitty]

On 3/21/2013 09:59, Xiangrong Fang wrote:
> I am not creating a new thread, but just replied it.

your post did not contain a references control line pointing to the post you 
were replying to... that breaks the linking and it won't be placed in the tree...

my 2 centavos...

> 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 <mailto: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