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
- 44997 Views
- Fidelity, Infosys, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is concurrentlinkeddeque?
Is stack a dynamic data structure?
How do you sort an arraylist in descending order?
State the demerits of linked representation of binary trees?
Why is waste sorting important?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
Describe the complexity of Binary search
Explain about the different lists available in the collection?
Tell me how to find middle element of linked list in one pass?
Is array of data structure?
What is treemap chart?
What is map keyset?
What exactly is a thread?
Define a path in a tree?
What are the advantages and disadvantages of linked list over array?
