Re: Search trees

[Robert A Duff <bobduff@shell01.TheWorld.com>]

"VBTricks.de.vu Webmaster" <vbtricks@gmx.net> writes:

> Doing this recursively is no problem, but for an exercise I now need to
> implement these functions iteratively (meaning not recursively). The
> only hint I got was to save which children trees I have not walked
> through. But after four days of thinking I still don't get it.

Do you understand how recursion works internally?  
Whenever you call a procedure, the machine code pushes
some information on a stack (return address, local variables).
If you want to avoid recursion, you can simulate this process
by writing explicit stack-management code.

- Bob