title: Algorithm for converting Binary tree to post-fix mathematical expression?
body: <p>I have a Binary tree for  a mathematical expression(infix), i want to convert directly this TREE to a postfix(Stack)
  can any body suggest the algorithm? </p>