title: Displaying the postfix/prefix expression as a parse tree using C/C++
body: <p>I have successfully converted infix expression to postfix expression and was also able to evaluate the postfix expression but I am facing problem in generating a parse tree for the same with C/C++</p>
  
  <p>My output :</p>
  
  <pre><code>           enter the expression string a+b*c
             the expression is correct
             the postfix expression is - abc *+
             enter the value of a-1
             enter the value of b-2
             enter the value of c-3
             the postfix expression is -abc*+
             result= 7
  </code></pre>
  
  <p>I also require to display: Syntax tree</p>
  
  <pre><code>               +          
               /   \                                
            *       a                               
           /   \                                               
          b     c       
  </code></pre>
  
  <p>Any feedback would be very helpful in my project.</p>
  
  <p>Thanks in Adv.</p>
  
  <p>@LD: Thanks for your consistent help.  I need the pseudocode in turbo C. I don't know Ruby.</p>