From: Jeffrey Carter <spam@spam.com>
Subject: Re: Search trees
Date: Fri, 13 May 2005 02:00:44 GMT
Date: 2005-05-13T02:00:44+00:00 [thread overview]
Message-ID: <gTTge.516$DK.410@newsread3.news.pas.earthlink.net> (raw)
In-Reply-To: <4282fe37$0$7517$9b4e6d93@newsread2.arcor-online.net>
VBTricks.de.vu Webmaster wrote:
> I'm currently working with search-trees, more exactly different methods
> of listings the items in the search-tree (postfix/postorder,
> infix/inorder, prefix/preorder).
>
> 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.
Sounds like homework to me.
One way to avoid recursion is to use a non-recursive searchable
structure, such as a skip list.
--
Jeff Carter
"I would never want to belong to any club that
would have someone like me for a member."
Annie Hall
41
next prev parent reply other threads:[~2005-05-13 2:00 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
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 [this message]
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