[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Sv: Sv: Sv: Strangest thing happened; ...

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

Ever tried recursion? Then the array is hidden as the call-stack itself
and is IMHO efficient.

Do you know AVL-Trees? Don't they fit better to your problem then array
based binary trees?

Sorry about these maybe ignorant questions but i don't know your
knowledge about efficient datastructures...

  mailto:breitling@lool.net  -==-  http://www.lool.net/breitling

		Linux: the other OS, with no Bill to pay.