Re: AVL-trees, hmm...

[Christian Reiniger <warewolf@mayn.de>]

Bjarke Hammersholt Roune wrote:

>>> 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.


	Christian
--

Drive A: not responding...Formatting C: instead