Is there an algorithm to evaluate a prefix expression. I googled and i could find a lot on evaluating a postfix expression using a stack. Thats cool, but i found almost no info on evaluating a prefix expression.
if the prefix expression is : +-/+abcd*fg,
the infix should be evaluated as (a+b)/c-d+(f*g)