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
- 21359 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 is adt example?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
Why is bubble sort stable?
What are vectors used for in real life?
Is Arraylist faster than Array? Why?
What is array and string?
Difference between hashset and treeset?
Describe the complexity of Binary search
How many parts are there in a declaration statement?
Why using cookie to store session info is a better idea than just using session info in the request?
Why is hashmap not thread safe?
What is sorting explain?
Why do we use trees in data structures?
What is range search?
Explain binary tree traversals?
