Which data structure is needed to convert infix notations to
post fix notations?
Answer Posted / rupesh
Stack is used to convert infix to postfix
| Is This Answer Correct ? | 10 Yes | 6 No |
Post New Answer View All Answers
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
What the principle of quick sort and its complexity?
What is b tree in data structure?
Why do we use a multidimensional array in data structure?
How many types of linked list exist?
Can map contain duplicate keys?
What is the purpose of tochararray ()?
Can sets contain duplicates?
Explain how is linked list implemented?
Is arraylist a class?
Which is better hashmap or hashtable?
Define primary clustering?
Why do we use linked lists?
What is concurrentlinkeddeque?
Explain binary search tree?