Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1
- 9 Answers
- 19959 Views
- I also Faced
- E-Mail Answers
Answer Posted / pavan
@ Revathy :
Postfix : AB+DC-*
Prefix : *+AB-DC
Best way to find Prefix adn post fix is to create a Binary
tree and do a pre-order traversal and post order traversal
on it.
| Is This Answer Correct ? | 7 Yes | 1 No |
Post New Answer View All Answers
List some applications of queue data structure.
Is treeset thread safe?
How to excel in data structures and algorithms?
What is array in data structure with example?
Tell me why can't constant values be used to define an array's initial size
Define a full binary tree ?
Parenthesis is never required in postfix or prefix expressions, why?
What is linked list in data structure?
Can we add elements to final list?
When new data are to be inserted into a data structure?
What are different sorting algorithms?
How would you check if a binary tree is BST or not ? Write a program.
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Can arraylist be resized?
What is collections singletonmap?
