From: Robert A Duff <bobduff@shell01.TheWorld.com>
Subject: Re: Search trees
Date: 12 May 2005 13:58:41 -0400
Date: 2005-05-12T13:58:41-04:00 [thread overview]
Message-ID: <wccy8ak2uni.fsf@shell01.TheWorld.com> (raw)
In-Reply-To: 42839738$0$25692$9b4e6d93@newsread2.arcor-online.net
"VBTricks.de.vu Webmaster" <vbtricks@gmx.net> writes:
> no I do not know how recursion works internally. But I think there must
> be another way. Can you help me?
Use a stack to keep track of which tree nodes have not yet been fully
processed.
- Bob
next prev parent reply other threads:[~2005-05-12 17:58 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
2005-05-12 6:58 Search trees VBTricks.de.vu Webmaster
2005-05-12 16:28 ` Robert A Duff
2005-05-12 17:51 ` VBTricks.de.vu Webmaster
2005-05-12 17:58 ` Robert A Duff [this message]
2005-05-12 18:07 ` VBTricks.de.vu Webmaster
2005-05-12 23:32 ` Georg Bauhaus
2005-05-13 2:02 ` Jeffrey Carter
2005-05-13 2:00 ` Jeffrey Carter
2005-05-14 14:57 ` VBTricks.de.vu Webmaster
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox