Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 38445 Views
- Fidelity, Infosys, I also Faced
- E-Mail Answers
Answer Posted / naresh
stack...since the operator last placed must be retrieved
first.
| Is This Answer Correct ? | 23 Yes | 5 No |
Post New Answer View All Answers
What is linear-logarithm chasm?
What is default size of hashmap?
How does sort function work?
What is a hashers run?
What is the difference between data type and data structure?
Explain what is a spanning tree?
What is the advantage of the heap over a stack?
Differentiate between hashmap and treemap.
Is any implicit arguments are passed to a function when it is called?
what is a balanced tree.
What is Storage Structures and File Structures? Can you show their relation? What are the examples of each? Thanks
What is sorting in data structure?
Is a hash table a map?
How would you use qsort() function to sort the name stored in an array of pointers to string?
List some applications of queue data structure.
