Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 38241 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
How do you rotate an AVL tree?
Why linked lists are better than arrays?
Where is insertion sort used?
Write an algorithm to show the reverse of link list?
Give the example of validating the parenthesis of expression using stack.
Name two algorithms two find minimum spanning tree?
Design a datastructure to represent the movement of a knight on a chess board
What do you mean by recursive definition?
What are the advantages of selecetion sort?
Which is faster arraylist or hashmap?
List some applications of multilinked structures?
What are the advantages of data structure?
How do you assign an address to an element of a pointer array ?
Mention the data structures which are used in graph implementation.
Difference between hashset and treeset?
