Sv: AVL-trees, hmm...

["Bjarke Hammersholt Roune" <asmild@post6.tele.dk>]

>>>> Does anybody know how to implement effecient external pre-order,
>in-order >>> and post-order iterators to binary trees without creating an
>array to >keep
>>>> track of what has already been iterated over?
>
>ppf_DirTreeNode implements methods GetNext () and GetPrev () (defined in
>ppf_DirEntry) that give the next resp. previous node according to the
>tree's sorting. They are used to iterate through the tree entries in an
>alphabetic order.
>
Actually, it doesn't matter anymore. I found a way to do what I wanted
without iterating (used bounds checking instead). Speded up adding by 50% in
the process too.