title: Infix to postfix algorithm that takes care of unary operators
body: <p>The I/p to the algo will be an expression like this:</p>
  
  <pre><code>a+(-b)
  a*-b+c
  </code></pre>
  
  <p>i.e any expression that a standard C compiler would support.</p>
  
  <p>Now I've the input already formatted as a stream of tokens , the tokens contain info whether its an operator or an operand.
  The algorithm should take this in and give me a postfix expression that I can evaluate.</p>
  
  <p>If I use the standard conversion algo, I <strong><em>cant differentiate between an unary and a binary op</em></strong>.
  Like a*(-b) would give me ab-* ,which would evaluate in the wrong way.</p>