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
- 21614 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / ahan
( ( a + 2 ) * ( b + 4 ) ) - 1
\ / /
a2+ b4+ /
\ / /
/
a2+b4+* /
\ /
a2+b4+*1-
| Is This Answer Correct ? | 58 Yes | 2 No |
Answer / arun chowdary g
a2+b4+*1- is correct because in postfix traversals are from
left, right and then root.
| Is This Answer Correct ? | 37 Yes | 4 No |
Answer / 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 |
Answer / revathy
Convert the following expression to postfix and prefix
(A+B) * (D-C)
| Is This Answer Correct ? | 5 Yes | 5 No |
Which is faster hashmap or treemap?
What is a data structure node class?
What is ascending and descending order?
What is selection in an algorithm?
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is dynamic array with example?
Is map a collection?
What is difference between treeset hashset linkedhashset?
Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1
How to get largest and smallest number in an array?
Write the importance of hashing?
Difference between arrays and linked list?
Windows 
