Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
UGC-NET | UGC NET CS 2014 Dec - II | Question 21
Last Updated :
Discuss
Comments
Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G
ABD^ + EF – / G+
ABD + ^EF – / G+
ABD + ^EF / – G+
ABD^ + EF / – G+
This question is part of this quiz :
Top MCQs on Stack Data Structure with Answers,UGC NET CS 2014 Dec - IIShare your thoughts in the comments
GeeksforGeeks