Which data structure is needed to convert infix notations to
post fix notations?
Answers were Sorted based on User's Feedback
Answer / naresh
stack...since the operator last placed must be retrieved
first.
Is This Answer Correct ? | 23 Yes | 5 No |
Answer / 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 |
Answer / kavitha
stack is only one where it allows the conversion of
notations i.e prefix<-> postfix<-> infix<-> conversions
Is This Answer Correct ? | 9 Yes | 2 No |
Answer / aditya
stack since conversion frm regular to postfix and similarly
frm regular to infix is based on stack concept so its a
stack aplication
Is This Answer Correct ? | 10 Yes | 4 No |
Can we insert null in list?
What is bubble sort technique?
What is the minimization factor and time complexity of b-tree?
What are the best data structure courses for gate preparation?
How many links are there in a binary tree of N nodes?
What is sequential search? What is the average number of comparisons in a sequential search?
Differentiate null and void?
What is the difference between binary tree and binary search tree?
What is the data structures used to perform recursion?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
What is sorting explain?
How would you use qsort() function to sort the name stored in an array of pointers to string?