From: cis.ohio-state.edu!news.sei.cmu.edu!firth@ucbvax.Berkeley.EDU (Robert Fi
Subject: Re: binary tree
Date: 17 Mar 93 17:42:17 GMT [thread overview]
Message-ID: <1993Mar17.124217.24190@sei.cmu.edu> (raw)
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.
next prev reply other threads:[~1993-03-17 17:42 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
1993-03-09 16:19 binary tree John Wogan
1993-03-09 20:51 ` Michael Feldman
1993-03-10 13:17 ` Don Tyzuk
1993-03-17 17:42 ` cis.ohio-state.edu!news.sei.cmu.edu!firth [this message]
1993-03-19 21:13 ` Michael Feldman
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox