Which data structure is needed to convert infix notations to
post fix notations?
Answer Posted / suhaani
stack
| Is This Answer Correct ? | 104 Yes | 6 No |
Post New Answer View All Answers
Which is better hashset or treeset?
In what areas do data structures applied?
Are dictionaries mutable?
What are red-black trees?
What is array define its types?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
What is bubble sort with example?
Define hashing?
What is a tech stack?
Are duplicates allowed in list?
Which searching algorithm is best?
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
How many types of priority queue are there?
Which sort algorithm is best?
Does list maintain insertion order?