From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-0.9 required=3.0 tests=BAYES_00,FROM_ADDR_WS
	autolearn=no autolearn_force=no version=3.4.5-pre1
Date: 17 Mar 93 17:42:17 GMT
From: cis.ohio-state.edu!news.sei.cmu.edu!firth@ucbvax.Berkeley.EDU  (Robert Fi
rth)
Subject: Re: binary tree
Message-ID: <1993Mar17.124217.24190@sei.cmu.edu>
List-Id: <comp.lang.ada>

In article <jwogan.731693966@unix1.tcd.ie> jwogan@unix1.tcd.ie (John Wogan) wri
tes:
>We need a binary tree package to implement/build an infix to postfix
>calculator. Help. Suggestions welcomed.

In article <1993Mar9.205136.13941@seas.gwu.edu> mfeldman@seas.gwu.edu (Michael 
Feldman) writes:

>Come now! Are you asking us to do your homework for you

I hope not, because in that case Mr Wogan is going to fail.  You don't
need a binary-tree package to solve that problem, or anything remotely
as elaborate.  You can do the transformation in one pass with a simple
operator-precedence parser.  Recurse when you hit a left parenthesis.