Interested to Buy Any Domain ? << Click Here >> for more details...
Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1
- 9 Answers
- 21335 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
What are the disadvantages array implementations of linked list?
What are the different binary tree traversal techniques?
How to inverting a function in sort and searching?
Define ancestor and descendant ?
Is arraylist fail fast?
How are the elements of a 2d array are stored in the memory?
What is the difference between hashset and arraylist?
What is dynamic array in excel?
How do you create a tree diagram?
Define the term “percolate up”?
What is a bubble sort and how do you perform it?
What is declaring array?
Does list maintain insertion order?
Can treemap have duplicate values?
Does stringutils isempty check for null?
