Interested to Buy Any Domain ? << Click Here >> for more details...
Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 44499 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 adt and its advantages?
What is the order of b tree?
What is data structure? Explain.
How much time does it take to learn data structures?
Explain Array of pointers?
Define indegree of a graph?
Define an algorithm. What are the properties of an algorithm?
Is it possible to increase size of array?
What does enum do?
What is the difference between adt and data structure?
Is binary tree a binary search tree?
What is precision in data structures?
Windows 
