Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 38185 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 different types of sorting? Explain the difference between them.
Is hashmap fail safe?
How do you explain bubble sort?
What is data type and its types?
Does concat mutate array?
How will you reverse Linked List.
What do you mean by quadratic probing?
Describe tree database. Explain its common uses.
Explain stacks and queues in detail.
Is hashmap a data structure?
Is list a data structure?
What is a b+ tree? Explain its uses.
Windows 
