Re: Search trees

[Jeffrey Carter <spam@spam.com>]

Georg Bauhaus wrote:

> 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.

Unless he uses one of the fine libraries available for Ada, such as the 
PragmAda Reusable Components (PragmARC.Stack_Unbounded, for example). 
But that's probably not acceptable for homework.

-- 
Jeff Carter
"I would never want to belong to any club that
would have someone like me for a member."
Annie Hall
41