Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 38330 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 is the default value of Array?
Describe tree database.
What is an algorithm in coding?
Which is the fastest sorting?
how to add an item to the beginning of the list?
Is it legal to initialize list like this?
Why is hashmap not thread safe?
What is the need for path compression?
Which is better array or linked list?
What is the limit of arraylist?
How do you sort a collection in descending order?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
Windows 
