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
- 44446 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
Write a program to insert an element and in the specific position in the array?
Is it possible to store null key and null values in a hashmap?
What is the difference between length () and size () of arraylist?
What is the difference between hashmap and treemap?
What thread means?
What is a stable algorithm?
What is priority queue in data structure?
Does hashmap maintain insertion order?
Explain what is the bucket size, when the overlapping and collision occur at same time?
What is the two-dimensional array?
Define a right-skewed binary tree?
Describe linear probing with an example.
Why is hashmap faster than arraylist?
Why quicksort is better than merge sort?
When new data are to be inserted into a data structure?
