Which data structure is needed to convert infix notations to
post fix notations?
Answer Posted / 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 |
Post New Answer View All Answers
What is the use of threaded binary tree?
What is list and its types?
Which sorting is worst?
What is a tech stack?
Is hashmap an array?
Explain extended binary tree.
Difference between hashset and treeset?
How does a treemap sort?
What is precision?
What is the difference between Strings and Arrays?
Describe queue operation.
How do you sort an array by value?
What is difference between list and set?
How long does it take to master data structures and algorithms?
What are the tasks performed during inorder traversal?