Which data structure is needed to convert infix notations to
post fix notations?

Answers were Sorted based on User's Feedback



Which data structure is needed to convert infix notations to post fix notations?..

Answer / suhaani

stack

Is This Answer Correct ?    104 Yes 6 No

Which data structure is needed to convert infix notations to post fix notations?..

Answer / pavan

Stack

Is This Answer Correct ?    66 Yes 6 No

Which data structure is needed to convert infix notations to post fix notations?..

Answer / selate

STACK

Is This Answer Correct ?    33 Yes 8 No

Which data structure is needed to convert infix notations to post fix notations?..

Answer / khater

(A + B) * (C + D) / ((E - F) / (G + H)) =

Is This Answer Correct ?    29 Yes 10 No

Which data structure is needed to convert infix notations to post fix notations?..

Answer / naresh

stack...since the operator last placed must be retrieved
first.

Is This Answer Correct ?    23 Yes 5 No

Which data structure is needed to convert infix notations to post fix notations?..

Answer / swapna

stack.....

Is This Answer Correct ?    24 Yes 8 No

Which data structure is needed to convert infix notations to post fix notations?..

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

Which data structure is needed to convert infix notations to post fix notations?..

Answer / guest

stack

Is This Answer Correct ?    10 Yes 2 No

Which data structure is needed to convert infix notations to post fix notations?..

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

Which data structure is needed to convert infix notations to post fix notations?..

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

Post New Answer

More Data Structures Interview Questions

Can we insert null in list?

0 Answers  


What is bubble sort technique?

0 Answers  


What is the minimization factor and time complexity of b-tree?

0 Answers  


What are the best data structure courses for gate preparation?

0 Answers  


How many links are there in a binary tree of N nodes?

0 Answers   Tech Mahindra,






What is sequential search? What is the average number of comparisons in a sequential search?

0 Answers  


Differentiate null and void?

0 Answers  


What is the difference between binary tree and binary search tree?

0 Answers  


What is the data structures used to perform recursion?

1 Answers  


How to traverse data in a linked list in forward and backward direction, write the algorithm?

0 Answers  


What is sorting explain?

0 Answers  


How would you use qsort() function to sort the name stored in an array of pointers to string?

0 Answers  


Categories