Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 38394 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 perfect binary tree?
What is push and pop in stack?
For searches. Which one is most preferred: array list or linked list?
What type of data structure is used to perform recursion?
Write the c program to insert a node in circular singly list at the beginning.
Write an algorithm to find middle element in the linked list.
How do you do a mergesort?
How will you free the memory that is allocated at run time?
What is sorting an array?
What is hashing in cyber security?
In what areas do data structures applied?
What do you mean by breadth first search (bfs)?
How can you add an item to the beginning of the list?
Define an algorithm.
How will you check the validity of an expression containing nested parentheses?
