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
- 44349 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 standard ways in which a graph can be traversed?
Define 2-3-4 tree?
Explain about the different lists available in the collection?
What is the use of threaded binary tree?
Which is better array or linked list?
How do I use quick sort?
Treemap orders the elements on which field?
Which type of efficient data structure is used in the internal storage representation in RDBMS?
Can a class have a constructor?
How is bubble sort done?
Why do we use insertion sort?
How can you insert a node in a random location of the linked list?
Windows 
