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
Date: Fri, 13 May 2005 01:32:18 +0200
From: Georg Bauhaus <bauhaus@futureapps.de>
Organization: elsewhere
User-Agent: Mozilla Thunderbird 1.0.2 (Macintosh/20050317)
X-Accept-Language: en-us, en
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Search trees
References: <4282fe37$0$7517$9b4e6d93@newsread2.arcor-online.net>
 <wcc8y2kz9vg.fsf@shell01.TheWorld.com>
 <42839738$0$25692$9b4e6d93@newsread2.arcor-online.net>
 <wccy8ak2uni.fsf@shell01.TheWorld.com>
 <42839af9$0$14732$9b4e6d93@newsread4.arcor-online.net>
In-Reply-To: <42839af9$0$14732$9b4e6d93@newsread4.arcor-online.net>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
NNTP-Posting-Host: 84.60.14.54
Message-ID: <4283e643_2@news.arcor-ip.de>
X-Trace: 13 May 2005 01:26:59 +0200, 84.60.14.54
X-Complaints-To: abuse@arcor-ip.de
Path: 
 g2news1.google.com!news3.google.com!news.glorb.com!newsfeed.stueberl.de!feed.news.tiscali.de!newsfeed.arcor-ip.de!news.arcor-ip.de!84.60.14.54
Xref: g2news1.google.com comp.lang.ada:11019
Date: 2005-05-13T01:32:18+02:00
List-Id: <comp.lang.ada>

VBTricks.de.vu Webmaster wrote:
> Hello Robert,
> 
> but how do I implement this? I have very little knowledge of Ada95 (at 
> least none of stack programming).

Not sure what you mean by "stack programming",
but what may be meant here is that you write some helper
subprograms.  Calling them will move nodes onto a "stack" and move them
back when necessary when you simulate recursive Infix. "Stack" here is
something that you program, it doesn't yet exist in the system.

It might help to pay attention to the imaginary steps you take
while executing Infix in your head.
  How do you remember nodes when you follow a call of Infix from
within Infix? How many nodes will you have to remember befor Put is
called for the first time? Why do you have to remember nodes, anyway?
How long will they have to be remembered?

The way a stack package can be written is likely described in
every book about programming in Ada. Which one do you have?


-- Georg