title: Calculating and converting prefix to infix
body: <p>I'm having some serious problems writing a program that convert prefix to infix. I have already written 2 programs which use stacks but do so differently - one used two stacks, the other used one with a recursive method. But I'm still having problems correctly doing it since the requirements demands that it use two stacks (operand and operator) and use a recursive method. I'm having serious problems visualizing both of those requirements together. Does anyone knows what the algorithm would look like? if i could simply have an algorithm, it would really be a life saver.
  Thank you</p>