Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 38277 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 |
What are the difference between a stack and a queue?
What is the time complexity of arrays sort?
Is array a dynamic data structure?
How many links are there in a binary tree of N nodes?
How do you sort an arraylist?
What is time complexity of quick sort?
What is the complexity of arrays sort?
Check if duplicates exist in an array of N which has range 1 to N.
Which is better hashmap or arraylist?
What do you mean by complexity of search algorithm?
What are the differences between b tree and b+ tree?
What are different types of linked lists?
Windows 
