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 you mean by sorting?
What is long data type?
Does hashset allow duplicates?
Explain what are the major data structures used in the network data model?
Explain about the different lists available in the collection?
Define the term “percolate down”?
What do you mean by the term “percolate up”?
How do you balance a tree?
What is difference between hashmap and treemap?
Is pointer a variable?
Differentiate stack from array?
Does treeset allow null?
Which sorting algorithms are in place?
What is ascending and descending order?
Does arraylist maintain insertion order?