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
State the properties of a binary tree?
Define a full binary tree ?
Is list same as array?
What is meant by strongly connected in a graph?
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
State the difference between stacks and linked lists?
When new data are to be inserted into a data structure?
What do u mean by data type?
Is tuple immutable?
Define heap order property?
What is binary tree in discrete mathematics?
How does a dynamic array work?
What is the need for priority queue?
What is the difference between Strings and Arrays?
How to show internal storage representation of data structure in RDBM?