Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 38419 Views
- Fidelity, Infosys, I also Faced
- E-Mail Answers
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
Can treemap key null?
Does hashmap maintain insertion order?
What is structure of data type?
What are the differences between b tree and b+ tree?
What is a priority queue?
What is bitonic search?
Mention the steps to insert data at the starting of a singly linked list?
What is insertion sort technique?
What should I learn first data structures or algorithms?
What is a treemap used for?
How do you get placements?
What is a string array?
What is data structure explain different types of data structures with examples?
Why quicksort is faster than merge sort?
Differentiate among cycle, path, and circuit?
