Can anyone help me to convert an infix expression to a prefix expression?
It should be using stacks, not binary trees.
I just need the algorithm and I'll code it myself.
I'll be glad if someone can tell me the algorithm since it's nowhere to be found.
Have you already searched the forum? It was discussed several times during last month...
All problems in computer science can be solved by another level of indirection,
except for the problem of too many layers of indirection.
– David J. Wheeler
Basic principle: infix consists of "term oper term", and you can resolve that by reading the term, oper and term, then stacking the term, term, oper or something like that.
--
Mats
Compilers can produce warnings - make the compiler programmers happy: Use them!
Please don't PM me for help - and no, I don't do help over instant messengers.
