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
- 44284 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 array of data structure?
Write an algorithm to show the postfix expression with the input given as : a b + c d +*f ? .
What is quick sort?
What are b tree keys?
What is a postfix expression?
State the difference between queues and linked lists?
How null key is handled in hashmap?
what is the difference between dynamic as well as non - dynamic data structures.
Which is the parent class of linkedlist class?
What is the use of hashtable?
Define an algorithm.
What are the different types of data structures?
Does arraylist shrink?
Does hashset allow duplicates?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
