Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 40856 Views
- Fidelity, Infosys, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / naresh
stack...since the operator last placed must be retrieved
first.
| Is This Answer Correct ? | 23 Yes | 5 No |
Answer / hodan
i need c++ Reverse Polish Notation (RPN) calculator that
evaluates postfix expressions. The calculator will
emphasize on the usage of a stack-like data
structure and stream I/O.
An Overview of RPN (postfix) evaluation
Consider the mathematical expression
(6 + 4) * 3 - 5
| Is This Answer Correct ? | 14 Yes | 6 No |
Answer / kavitha
stack is only one where it allows the conversion of
notations i.e prefix<-> postfix<-> infix<-> conversions
| Is This Answer Correct ? | 9 Yes | 2 No |
Answer / aditya
stack since conversion frm regular to postfix and similarly
frm regular to infix is based on stack concept so its a
stack aplication
| Is This Answer Correct ? | 10 Yes | 4 No |
Which sorting is best?
What is meant by a dynamic array?
Which is the parent class of list<e> class?
What is the difference between Array and Arraylist?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
0 Answers Agilent, ZS Associates,
What is a data structure? What are the types of data structures? Briefly explain them
Why do we use a multidimensional array in data structure?
What is stable sort?
Define probing?
Is array part of collection framework?
In which data structure, elements can be added or removed at either end, but not in the middle?
42 Answers Infosys, NIC, TTA, Wipro,
Does stringutils isempty check for null?
Windows 
