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
- 43622 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
Is pointer a variable in data structure?
Define a binary tree?
What is difference between hashtable and hashmap?
How do you replace an element in an arraylist?
What is ascending and descending order?
How does a binary search work?
Is hashmap a data structure?
How can you insert a node in a random location of the linked list?
What are b tree keys?
Is sorting a math skill?
Is treemap synchronized?
Why insertion is faster in linked list?
Define a tree?
How helpful is abstract data type of data structures?
Give a basic algorithm for searching a binary search tree?
