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
- 43663 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 family trees and connection by clause?
How do you sort an array in descending order?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
Explain the sorting algorithm that is most suitable to be used with single linked list?
Can you tell me the differences between Array and ArrayList?
In which matrix, we can use multilinked structures?
What is a treemap used for?
What is Another name of Dynamically allocating memory.
Explain the expression trees?
Tell me can the size of operator be used to tell the size of an array passed to a function?
Define primary data structures?
Define internal nodes?
Windows 
