From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,3a91e8aaa1d74db9
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!news.glorb.com!news.mv.net!nntp.TheWorld.com!not-for-mail
From: Robert A Duff <bobduff@shell01.TheWorld.com>
Newsgroups: comp.lang.ada
Subject: Re: Search trees
Date: 12 May 2005 13:58:41 -0400
Organization: The World Public Access UNIX, Brookline, MA
Message-ID: <wccy8ak2uni.fsf@shell01.TheWorld.com>
References: <4282fe37$0$7517$9b4e6d93@newsread2.arcor-online.net>
 <wcc8y2kz9vg.fsf@shell01.TheWorld.com>
 <42839738$0$25692$9b4e6d93@newsread2.arcor-online.net>
NNTP-Posting-Host: shell01.theworld.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: pcls4.std.com 1115920722 20831 192.74.137.71 (12 May 2005 17:58:42
 GMT)
X-Complaints-To: abuse@TheWorld.com
NNTP-Posting-Date: Thu, 12 May 2005 17:58:42 +0000 (UTC)
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2
Xref: g2news1.google.com comp.lang.ada:11014
Date: 2005-05-12T13:58:41-04:00
List-Id: <comp.lang.ada>

"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