Abstract Data Types on Data Structure and Algorithms related Questions and Answers


Question :   Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

1. xyz*+pq*r+s*+
2. xyz*+pq*r+s+*
3. xyz+*pq*r+s*+
4. None of the mentioned
Answer :   1 - xyz*+pq*r+s*+  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter